Information infrastructure enabling mind supportable by universal computing devices

ABSTRACT

Methods and systems provide the infrastructure supporting an omniphysical mind or descriptive self supportable by a computing device. The infrastructure includes descriptive information capabilities and special symbols that support the capabilities. For example, a system may include at least one processor and memory storing a database that includes symbols, definitions of symbols, and processing rules. Symbol in the database may represent awareness capabilities, a categorization capability, a decision capability, a safety capability, a report capability, and a self-initiate capability. One special symbol may represent the ability of the system to organize and call the other special symbols that support the infrastructure.

RELATED APPLICATIONS

This application claims priority to Provisional Patent Application Ser.No. 61/914,157, entitled “AN INFRASTRUCTURE ENABLING AN OMNIPHYSICALDESCRIPTIVE SELF” filed on Dec. 10, 2013. The subject matter of thisearlier filed application is hereby incorporated by reference.

BACKGROUND

We humans exist in and have consciously aware experiences in the termsof two distinct kinds of information: physical information anddescriptive information. For example, when a pin pricks our finger weare consciously aware of the feel of pain as well as consciously able todescribe the prick as painful. Physical information is manifest in theembodied orderliness of physical form and function—such as in thesensors and nervous system devices and their operations that make usconsciously aware of the pain. Descriptive information is of an entirelydifferent kind and exists as defined meanings within a system of linkedsymbols. Each kind of information can enable individual selfdom in itsinformation terms. Body is the physical self mind is the descriptiveself. Among their many other capabilities, each self is consciouslyaware. But the nature of that conscious awareness is entirely different,occurring in each self's distinct information terms. Body is consciouslyaware in the information terms of its sensory representational devices.Mind is consciously aware in the terms of meanings arising within thedefined relations of the symbol system constituting it. Symbolicrepresentation rests on information assignment in which a physicalobject is assigned to represent something else, becoming a symbol tokenrepresenting the assigned content. Symbol systems arise when multiplesymbols are linked and defined in terms of each other. Users not onlylearn what the symbol denotes but also its descriptive meaning in thedefined terms of the symbol system (such as those compiled in adictionary). Since the choice of symbol tokens for informationassignment is discretionary, descriptive information can be represented,conserved, and processed by any number of material means. Unlikephysical information which exists in the embodied orderliness ofspecific physical form and function, descriptive information isindependent of the information of its material supports and can beenabled by any number of physical means: descriptive information isomniphysical. Because mind is a symbol-based system existing indescriptive information terms, it can be supported omniphysically. Amongother things this opens the way for mind to be freed from a dyinganimal.

SUMMARY

Implementations specify a descriptive information infrastructure whosestructures and capabilities enable seminal omniphysical mind.Omniphysical means that the infrastructure enabling mind can besupported by appropriate computing devices in general, regardless ofspecific platform. Omniphysical mind is a descriptive system that isconstituted as an autonomous self. Among other capabilities, it isconsciously aware and self-aware; is self-constituting in its semantics;sustains its ongoing existence; makes decisions in its self-interest;interacts with external environments; parses and categorizesinformation; and is able to coherently grow its memory stores, all indescriptive information terms. The infrastructure enabling omniphysicalmind is broadly applicable and can support mind using any appropriatedescriptive semantics of self. That is, the infrastructure is able to bepopulated with the specific descriptive content of a mind, enabling thatparticular mind's existence on any number of computational devices. Byfar the most significant application is that omniphysical mind is theinformation foundation enabling an individual's living persistence. Ableto be supported by any number of computational means and when properlyenabled, an individual's omniphysical mind can move to, be supported by,and command any number of alternative physical bodies. Put in formalterms, omniphysical mind is the information store for a unit of life'spersistence at the level of the individual. Put plainly, the ability ofmind to move from body to body allows an individual to live on and ondespite the fact that each particular body must ultimately wear out. Inthe face of the universal fact of material dissipation, omniphysicalityis the only means to enable an individual's living persistence.

In addition and less expansively, omniphysical mind can be applied in abroad spectrum of activities, including in intelligent systems directingmechanical devices deployed where direct human presence would bedangerous or impossible. For example, omniphysical mind may be used inindustrial, military, or extra-terrestrial applications for whichautonomy based on conscious awareness and self-awareness, the ability toprocess information from the environment, make appropriate decisions,and act to self-preservation enables the success of the mission. Forexample, a rover or other mechanical device on an extra-terrestrialmission may use its real time awareness of the environment, itsawareness of its mission goals, and its self-awareness of its owninformation and capabilities to take appropriate actions without needfor ground-based guidance.

The details of one or more implementations are set forth in theaccompanying drawings and the description below. Other features will beapparent from the description and drawings, and from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram that illustrates an example of aphysically-supported omniphysical mind (descriptive self).

FIG. 2A is a flowchart illustrating an example interpreter processsupporting an omniphysical mind (descriptive self), according to animplementation.

FIG. 2B is pseudo-code illustrating an example interpreter processsupporting an omniphysical mind (descriptive self), according to animplementation.

FIG. 3A is a flowchart illustrating example rules supporting anawareness capability in descriptive information terms, according to animplementation.

FIG. 3B is pseudo-code illustrating an example process supporting anawareness capability in descriptive information terms, according to animplementation.

FIG. 4 is a flowchart illustrating example rules supporting aself-initiate capability, according to an implementation.

FIG. 5 is a flowchart illustrating example rules supporting a formatcapability, according to an implementation.

FIG. 6 is a flowchart illustrating example rules supporting a decisionmaking capability, according to an implementation.

FIG. 7 is a flowchart illustrating example rules supporting a safetycapability, according to an implementation.

FIG. 8 is a flowchart illustrating example rules supporting acategorization capability, according to an implementation.

FIG. 9 is an example categorization scheme, according to animplementation.

FIG. 10 is a flowchart illustrating example rules supporting apreference set update capability, according to an implementation.

FIG. 11 is a flowchart illustrating example rules supporting a reportingcapability, according to an implementation.

FIGS. 12A and B illustrate an example data store supporting adescriptive self, according to an implementation.

FIG. 13 is an example of acquiring awareness of a normal symbol usingthe process for acquiring awareness and the data store of FIG. 12A.

FIG. 14 is an example of acquiring awareness of being aware using theprocess for acquiring awareness and the data store of FIG. 12B.

DETAILED DESCRIPTION

Disclosed implementations specify an infrastructure which enablesomniphysical mind. Omniphysical means that the infrastructure is able tobe supported in general by any number of computational devices,regardless of specific platform. Omniphysical mind is an autonomousdescriptive self that is consciously aware and self-aware; able toself-initiate its operations and awareness; able to persist indefinitelyin its information terms; able to process any appropriate descriptivecontent; able to parse and categorize incoming information; able toupdate its information stores in light of new information; able to makedecisions in its self-interest; and able to appropriately report contentto outside environments.

Implementations provide a descriptive system in which information arisesin the relations among linked definitions and their symbols. All of thesystem's structures, contents, and rules for processing symbols exist indescriptive information terms. The processing rules supporting theoperations of mind are algorithmic, enabling its operations to bephysically supported by any appropriate universal computational device,that is, omniphysically.

The descriptive consciousness or awareness of omniphysical mind arisesthrough its ability to generate descriptive meanings in the informationterms that constitute it, including the description of itself as theconsciously aware entity with its capabilities and content. Theomniphysical descriptive self is fully conscious in its descriptiveinformation terms. Its full awareness encompasses the capabilities to beaware of the meaning of any of its content, aware of itself as the awareentity, aware of all of its information and operations, aware that it isaware of the meaning of any of its content, and to be aware ad infinitum(aware of being aware of being aware and on and on). Able to be aware ofitself as aware as well as of all of its content and capabilities,omniphysical mind is self-identifying and self-inspecting. Thedescriptive self gains awareness by being able to generate meanings inthe information terms of its descriptive content. Self-awareness arisesbecause those meanings include the description of itself as the awareentity, that self being the descriptive system itself. Thus, the systemis able to generate both the content being experienced as well as theself-identified entity having the experience, all in descriptive terms.Put another way, the definitional flexibility of description supportsboth the object being consciously experienced and the subject doing theexperiencing, all as part of the same self-contained descriptive system.

As with our own minds when physically supported, omniphysical mind isself-constituting in its semantics, able to initiate and execute itsoperations encompassing its capabilities and content. It can not onlyprocess information inputs but can self-initiate and sustain itsawareness and self-awareness in the absence of such inputs. In additionand when physically supported, omniphysical mind is persistent, that is,its capabilities are indefinitely operable on a foundation of processingrules that are well-defined and algorithmic. It protects its persistenceboth through its ability to guard against inputs that could undermine it(e.g. a safety capability) as well as by storing the bases of itinformation capabilities in a read only portion of the data store.

To support its interactions with external descriptive environments,omniphysical mind is able to receive external information inputs,examine those for their operational compatibility and parse the inputsfor their appropriate processing. That processing may includecategorizing the input according to its existing categorization schemes.If the input can't be categorized within existing meanings, the self mayexpand its categorization scheme to accommodate the new information,supporting mind's coherent semantic growth.

Supporting its autonomy, omniphysical mind has the capability to makedecisions based on its interests. In making decisions, the self selectschoice options that meet its requirements, where those may require thatoptions possesses particular attributes and/or that the options notpossess others. If there is more than one option satisfying all of therequirements, the self can rank alternatives according to itspreferences, choosing the one conferring the greatest utility.

In order to support its interactions with its external descriptiveenvironments, omniphysical mind can report its descriptive content. Inline with its autonomy, omniphysical mind does not automatically accedeto requests to report. Instead, it evaluates the nature of the requestin light of the party making the request to determine if the requestedreport should be made.

To support the information capabilities described above the systemincludes at least three types of symbols: special symbols, normalsymbols, and categorization scheme symbols. Special symbols are thoserepresent the capabilities that constitute the operationalinfrastructure supporting omniphysical mind. The meaning of a specialsymbol is the processing operations, or rules, that support particularcapabilities represented by the special symbol. The meaning of a specialsymbol is specific and fixed in order to assure the functioning of theinfrastructure of the descriptive self. The special symbols are storedin a read-only, protected portion of the data store to protect thesystem from disruption.

Normal symbols are open to assignment of descriptive content. Theyprovide the representational vehicles for descriptive content to beprocessed by the infrastructure—content of which the descriptive selfcan be aware, categorize, evaluate, etc. Normal symbols can representany assigned content at any level of generality or semanticcharacterization, such as formally defined, empirically-based, ornormative in nature, etc. But as an infrastructure of omniphysical mind,this disclosure does not specify any such particular content, only therepresentational means and capabilities through which any such contentcan be processed. Normal symbols are stored in a ‘read-write’ portion ofthe database.

Categorization scheme symbols are those used to represent and implementomniphysical mind's categorization schemes and can be generated byprocessing rules as part of the self's categorization capability.Accordingly, categorization scheme symbols are stored in a ‘read-write’portion of the data store. Applied to the system's hierarchicalcategorization capability, one type of categorization scheme symbolrepresents nodes in a categorization hierarchy. The definition of such acategorization scheme symbol includes the normal symbols that belong inthe category (or node). The definition may also include othercategorization scheme symbols that are children, or sub-categories, ofthe category. Of course, if the categorization scheme isnon-hierarchical, the categorization scheme symbols may be used torepresent categories in the non-hierarchical scheme. A second type ofcategorization scheme symbol represents belonging to a category. Thus,each categorization scheme symbol that represents a category may have acorresponding belonging-to categorization scheme symbol. Thebelonging-to categorization scheme symbol may be appended to thedefinition of a normal symbol after the normal symbol has beencategorized. The definition of a belonging-to categorization schemesymbol is itself, thus the belonging-to categorization scheme symbol isprimitive.

The database supports the content and operations of omniphysical mind.Special symbols represent the processing rules supporting thecapabilities of the system and are stored in a ‘read-only’ portion ofthe database. Each content symbol is stored in the ‘read-write’ portionof the database and may be organized as an Omniphysical Mind SymbolStructure (OMSS) comprised of the symbols representing its definition;its categorization; the utility (preference) accorded to the symbol; anda privacy index representing the degree of confidentiality accorded tothe symbol. This OMSS may include a list of all other symbols thatcontain the symbol in their definitions, along with the address of eachof those symbols. This format supports the decision process in whichoptions are selected based on requirements. For example, a requirementmay be that each option includes content represented by S₁. By accessingthe OMSS of S₁, the system can produce all symbols containing S₁ andtherefore meeting the requirement.

FIG. 1 is a schematic diagram that illustrates an information system 100enabling omniphysical mind, that is, mind supportable by universalcomputational devices. Omniphysical mind is a symbol-based descriptivesystem constituted in its symbols, definitions, and processing rules andcan be physically embodied and supported by for example, on one or morecomputing devices 10. Those devices can be any universal computationaldevice such as a digital computer, for example, a personal computer, anotebook, a netbook, a tablet, a server, a mainframe, or some othersimilar computing device. The information system 100 may also include acombination of one or more computing devices 10. For example, two ormore computing devices 10 may be physically or logically distinct fromeach other but in communication with each other via a communicationsnetwork (not shown). Network data can flow through a variety ofmechanisms: communication software and hardware, telephone wires,broadband cable, wireless and microwave transmission units, satellite,fiber optics, and so on. The network can include one or more segmentsand/or can have portions based on various protocols such as InternetProtocol (IP) and/or a proprietary protocol. The network can include atleast a portion of the Internet. In some implementations, the networkcan include multiple computing devices and/or multiple server devices.The computing device 10 can include one or more hardware processors 110configured to execute one or more machine executable instructions orpieces of software, firmware, or a combination thereof. Processor 110may be any hardware device used to execute binary computer commands. Thecomputing device 10 can include one or more computer memories, such as amain memory, flash, disk, etc., configured to store data, eithertemporarily, permanently, semi-permanently, or a combination thereof.The memory may include volatile memory, non-volatile memory, or acombination thereof. At least some of the memory may be used as storagemedium capable of storing data in a semi-permanent or substantiallypermanent form.

For example, computing device 10 may include a data store 140 thatstores the symbols representing the descriptive content of the system100. The data store 140 can be a flat file, a relational database, ahierarchical database, or any other type of file or data store capableof storing and retrieving information. The data store 140 may also be adistributed data store that includes various types of memories and/oracross multiple networked computing devices. For example, the data store140 may include a protected portion and a content portion. The protectedportion may include any type of memory that retains data even when thecomputing device 10 is turned off. In some implementations, at leastsome of the data in the protected portion may be included in memoryembedded in the processor 110, for example as part of the processorchipset. The protected portion of the data store 140 stores theprocessing rules, and the special symbols and their definitions. Theprotected portion may be ‘read only’, in the sense that processes anddevices cannot write to the protected portion. The content portion ofthe data store 140 may include any type of memory that retains data evenwhen the computing device 10 is turned off. The content portion storesnormal symbols and their definitions after they have passed a safetycheck, the definition for the system special symbol (explained laterherein), and special category symbols. This portion of the database isread-write. Each portion of the data store 140 may be stored in avariety of memories. For example, the protected portion may be storedpartially in ROM, partially in flash memory, and partially in disk, asone example. Likewise, the various portions of the data store 140 may bestored across multiple computing devices, such as networked servers.

The foundation elements of an infrastructure supporting omniphysicalmind (the descriptive self) include symbol tokens, definitions ofsymbols in terms of symbols, the ensuing linkages among symbols, andrules for processing symbols. Thus the data store 140 may storedescriptive content that includes symbols 141, definitions 142,preference sets 143, reference lists 144, and rules 145. The symbols 141may include special symbols, categorization scheme symbols, listsymbols, and normal symbols. A normal symbol may have a correspondingdefinition that includes one or more normal symbols and optionally oneor more belonging-to category symbols. A special symbol may have acorresponding definition that includes one or more rules 145 and,optionally, one or more special or normal symbols. A categorizationscheme symbol may have a definition that includes the normal symbolsthat belong in the category (or node) and other categorization schemesymbols that are children, or sub-categories, of the category. Ofcourse, if the categorization scheme is non-hierarchical, thecategorization scheme symbols may be used to represent categories in thenon-hierarchical scheme. A second type of categorization scheme symbol,the belonging-to categorization scheme symbols, may have a definitionthat is itself. The meaning of a particular symbol is derived by fullyexpanding its definition in terms of symbols to which its definition islinked. List symbols may have a definition that includes sets of symbolsand their definitions (e.g., a symbol paired with its definition) orsets of symbols and their meanings (e.g., a symbol paired with itsmeaning) The rules 145 are rules for processing the symbols 141 form thebasis of the information capabilities of omniphysical mind. The rules145 are algorithmic instructions for manipulating symbols and can thusbe executed on any universal computing device such as a digitalcomputer. For example, rules 145 may include: call a symbol from thedata store, call a definition from the data store, and replace a symbolin a definition with that symbol's definition, etc. Rules 145 may berepresented by symbols such as R₁, R₂, R₃, etc. and be designated asprimitives.

FIGS. 12A and 12B illustrate one example of symbols 141, definitions142, preference sets 143, reference lists 144, and rules 145 in datastore 140. It is understood that the symbols, definitions, preferencesets, reference lists, and rules depicted in FIGS. 12A and 12B arelimited in number for the sake of brevity and illustration and do notrepresent all symbols supporting a fully functional omniphysical mind,and that the data store 140 may include any number of symbols,definitions, preference sets, reference lists, and rules, depending onthe purpose and function of the information system. Thus,implementations are not limited to the number or names of symbolsillustrated in FIGS. 12A and 12B. The symbols 141 may include a contentportion illustrated in FIG. 12A that stores normal symbols 141A,categorization scheme symbols 141C, and list symbols 141D. The symbols141 may also include a protected portion illustrated in FIG. 12B thatstores special symbols 141B. Likewise, the definitions 142 may have acontent portion 142A, 142C, and 142D, that stores definitions for normalsymbols, categorization scheme symbols, and list symbols as well as aprotected portion 142B that stores definitions for special symbols.Furthermore, although not shown in FIGS. 12A and 12B, a rule may alsohave a definition in the database so that a rule can have a meaningdefined in terms of other rules and symbols. The database of FIGS. 12Aand 12B may be an example of data store 140 of FIG. 1. As shown in FIG.12B, the symbols 141 may include special symbols S_(AWARE), S_(ALGO),S_(SYSTEM), S_(FORMAT), S_(CATEGORIZE), etc., which enable certaincapabilities, including certain forms of awareness.

As illustrated in FIGS. 12A and 12B, symbols 141 may have an associatedpreference set 143. A preference set may include two components, autility and a privacy rating. The utility may represent a preferenceaccorded to the symbol and may be numeric. The privacy rating mayrepresent the degree of confidentiality accorded to the symbol and maybe numeric. In some implementations, only normal symbols have a utilitycomponent. In some implementations, the privacy rating for normalsymbols may be updated but the privacy rating for all other symbols maynot be updated.

In some implementations, at least some of the symbols in the data store140 may be organized using an omniphysical mind symbol data structure(OM symbol structure or OMSS). The OM symbol structure may include thesymbol, the definition of the symbol, a preference set for the symbol,and the reference list for the symbol. The reference list is a list ofother normal symbols that include the symbol in their definition. Insome implementations, only normal symbols may be organized using an OMsymbol structure.

The computing device 10 may also include an interpreter 150 thatsupports implementations of omniphysical mind (the descriptive self). Inother words, whenever physically supported (e.g., executing on acomputing device, such as computing device 10), the interpreter 150 isalways running. The interpreter 150 may be stored in read-only memory,e.g., a main memory, in a storage medium, embedded in the processor, orin a combination of these. The interpreter 150 may use the processor 110and the information in data store 140 to perform operations that enablethe descriptive self to exist as an aware and self-aware individual selfable to persist indefinitely, making decisions in its self-interest,including those that secure its persistence, and interacting with anexternal environment while coherently growing its information stores,among other capabilities. The interpreter 150 may perform two mainfunctions. First to appropriately call the special symbols that togetherenable the proper functioning of omniphysical mind, the interpreter 150may maintain and call a processing queue of special symbols 152 (Q_(R))supporting the information capabilities of the self. The processingqueue may be a memory structure stored in memory 115. Special symbols inthe processing queue 152 may indicate capabilities that the interpreter150 initiates and the processing queue 152 may represent the order ofinitiation.

Memory 115 may also store an input queue 154 and a self-initiate queue156. Memory 115 may be any type of memory that saves data even when thecomputing device 10 is turned off. For example, the input queue 154 maystore a new input, which may cause the interpreter 150 to call theappropriate special symbols for handling input, generating their meaningto enable the processes for parsing and categorizing the symbol, amongothers. The second function of the interpreter 150 is related to theself-initiate capability which supports the system's awareness and fullself-awareness even in the absence of external inputs. In this role,interpreter 150 generates the meanings of special symbols enabling thesystem's awareness of itself as the aware entity as well its awarenessof its content and capabilities, thus giving rise to itsfull-self-awareness. For example, in the absence of external inputs, theinterpreter 150 may call the appropriate special symbol giving rise tothe self-initiate process, which sustains the awareness andself-awareness of omniphysical mind. The self-initiate queue 156 storesthe special symbols, or pointers to the special symbols, that enable theself to be fully self-aware, for example a special symbol thatrepresents the capability of awareness and a special symbol thatrepresents the descriptive content and capabilities of the system.

To protect the infrastructure from disruption, special symbols arestored in a protected portion of the database 140 that is ‘read only.’The capabilities of the interpreter 150 may be represented by aninterpreter special symbol (S_(INTERPRETER)). This symbol may be storedin the protected portion of the symbols 141 of the database 140.

Computing device 10 may also include input-output (I/O) devices 130 thatallow the computing device 10 to provide information to and receiveinformation from one or more computing devices 190 or other users. Forexample, I/O devices 130 may include network ports, keyboards, monitorsor other display devices, printers, speakers, touch screens, Bluetoothreceivers, mice, microphones, cameras, etc. In some implementations,computing device 190 may represent an intelligent system that gathersinformation and provides the information, in the form of one or moresymbols 141 and definitions 142, to computing device 10. In someimplementations, a user may provide the information to computing device190 and/or computing device 190 may gather data and generate theinformation itself. In some implementations, computing device 190 may bein communication with computing device 10 over a network, which mayinclude local area networks, wide area networks, the Internet, or any ofthe networks described above. Computing device 10 may also includeinterface 120. Interface 120 may direct certain input to the input queue154 for processing by the interpreter 150 and may provide data from theinterpreter 150 to output devices 130. In some implementations,interface 120 may be optional or may be incorporated into theinterpreter 150. In other words, in some implementations the I/O devices130 may provide input directly to or receive output directly from theinput queue 154 or interpreter 150. Computing device 10 may also includean operating system (not shown). Of course, the computing device 10 mayinclude one or more other hardware or software components not shown inFIG. 1.

FIG. 2A is a flowchart illustrating an example interpreter process 200supporting an omniphysical mind, according to an implementation. Process200 may be performed by an interpreter of a symbol-based informationsystem, such as interpreter 150 of computing device 10 of FIG. 1. Theinfrastructure supporting an omniphysical descriptive self uses a set ofprocessing rules and special symbols that enable correspondingcapabilities of awareness, processing incoming information, andpersistence, among others. Accordingly, the processes illustrated inFIG. 2A may be represented by rules for a definition of an interpreterspecial symbol stored in the data store of the information system. Inthe example of FIG. 2A, the interpreter of the symbol-based informationsystem may check a processing queue of special symbols (Q_(R)) for asymbol or rule (205). The processing queue may be a memory structure.The interpreter may generate and manage the processing queue, which maypoint to or be filled with special symbols. If the processing queue isempty (205, Yes), the interpreter may determine whether an input queueis empty (210). The input queue may also be a memory structure generatedand managed by the interpreter. If the input queue is empty (210, Yes),the system has no inputs to process, so the interpreter may place aself-initiate special symbol into the processing queue (220). Theself-initiate special symbol allows the system to maintain its selfdom,able to be aware of itself and to process information in the absence ofinputs. With the self-initiate special symbol in the processing queue,the interpreter may find the symbol in the processing queue (205, No),initiating the capability associated with the self-initiate specialsymbol.

When the interpreter finds a special symbol in the processing queue(205, No), the interpreter may fetch the symbol from the processingqueue (225). The interpreter may then get the operational meaning of thespecial symbol (230). The operational meaning is represented by one ormore processing rules in the definition of the special symbol.Determining the meaning of a symbol is discussed in more detail belowwith regard to FIGS. 3A and 3B. The interpreter may put the processingrules back into the processing queue, replacing the special symbol withthe rules that comprise the meaning of the special symbol (235). In someimplementations, the special symbol may have been removed from theprocessing queue as part of step 225. The interpreter may execute thefirst rule in the processing queue and remove it after execution (240).The interpreter continues checking the processing queue for specialsymbols or processing rules (205). As long as the processing queue isnot empty, the interpreter will continue determining the operationalmeaning of special symbols in the processing queue and executing theoperations, represented by rules, identified in the operational meaning.It is understood that if the interpreter finds a rule in the processingqueue at 205, the interpreter may skip steps 225 to 235 and proceeddirectly to step 240, thus executing the rule.

When the processing queue is empty, the interpreter may check the inputqueue. If the input queue is not empty (210, No), the interpreter mayput the format special symbol in the processing queue. As will bediscussed in more detail below, the format special symbol enables thesystem to process incoming information, including verifying the formatof incoming input and initiating appropriate processing of the input.Once the format special symbol is in the processing queue, theinterpreter may return to step 205, find the format special symbol (205,No) and execute the rules that comprise the operational meaning, e.g.,the format capability. FIG. 2B is pseudo-code illustrating an exampleinterpreter process supporting an omniphysical descriptive self,according to an implementation. The pseudo-code of FIG. 2B is an exampleimplementation of the interpreter, or in other words, the processingrules of the operational meaning of the interpreter special symbol,which is also illustrated in FIG. 2A.

Awareness Capability

FIG. 3A is a flowchart illustrating an example iterative process 300 foracquiring awareness in descriptive information terms, according to animplementation. Omniphysical mind becomes consciously aware ofdescriptive content by establishing a symbol's meaning in the definedterms of the system. Process 300 may represent an awareness capability,also referred to as an awareness algorithm, which may be performed bythe interpreter as part of step 230 of FIG. 2A, as well as at othertimes when the meaning of a symbol is determined. Process 300 allows asymbol-based information system to determine the meaning of any symbolin the data store, thereby acquiring various forms of awareness,depending on the symbol used to initiate the process. The interpretermay first obtain a definition for a particular symbol from the database(305). The particular symbol may be any of the symbols that comprise thesymbol-based information system, as defined by the database, includingspecial symbols. For the purposes of discussing FIG. 3A, the particularsymbol may be referred to as the original parameter symbol, or thesymbol that initiated the process. The interpreter may determine if thedefinition is a primitive definition (310). A definition is primitive ifit can be expanded no further. A definition may be expanded no furtherif it includes only its corresponding symbol in the definition, forexample if the definition of the parameter symbol includes only theparameter symbol itself. In some implementations, definitions may bemarked or flagged as primitive in the data store. Any conventional orlater discovered manner of marking the definition as primitive may beused. If the definition is primitive (310, Yes), the interpreter mayhave determined the meaning of the symbol. If the current iteration ofprocess 300 is the original iteration (315, Yes), the interpreter mayreturn the symbol(s) of the definition as the meaning of the originalparameter symbol (360) and process 300 ends, having determined themeaning of the original parameter symbol.

If the definition is not primitive (310, No), the interpreter mayiteratively call the awareness algorithm to determine the meaning of thesymbols in the definition of the original parameter symbol. For example,the interpreter may select a first symbol from the definition (355) andcall process 300 for the selected symbol (350). The selected symbol thusbecomes the parameter symbol for the current iteration of process 300.The dotted line from 350 to 305 represents the iterative call in FIG.3A. Process 300 may then begin for the selected symbol, which is now theparameter symbol for the current iteration. Thus, the interpreter mayobtain the definition from the database (305) and determine whether itis primitive (310). If the definition is primitive (310, Yes), theawareness module may exit the iteration because this iteration is notthe original iteration (315, No) and return the symbol(s) of thedefinition as the meaning of the current parameter symbol (320). Thedot-dashed line in FIG. 3A between 320 and 325 represents the conclusionof the current iteration, returning the meaning to the callingiteration. The calling iteration thus becomes the current iteration. Theinterpreter may concatenate the returned meaning of the symbol to themeaning of the parameter symbol (325) and determine whether thedefinition of the parameter symbol is fully expanded (330). For example,if the parameter symbol for the current iteration had a definition thatincluded two symbols, and only the first symbol was expanded, thedefinition is not fully expanded (330, No). Thus, the interpreter willselect the next definition symbol (345) and call process 300 for thenext symbol (350). Thus, the interpreter may iteratively invoke theawareness algorithm to determine the meanings of the symbols used in thedefinitions.

When a definition for a symbol is fully expanded (330, Yes), if theiteration is not the original iteration (335, No), the interpreter mayend the iteration, passing the meaning of the symbol to the previous, orcalling, iteration (340). The dot-dashed line in FIG. 3A between 340 and325 represents the conclusion of the current iteration, returning themeaning to the calling iteration, making the calling iteration thecurrent iteration. Once the symbols of the definition of the originalsymbol have all been fully expanded (330, Yes) and (335, Yes), theinterpreter may return the symbol(s) of the definition (from step 325)as the meaning of the original parameter symbol (360) and process 300may end. FIG. 3B is pseudo-code illustrating an example iterativeprocess for acquiring awareness, according to an implementation. Thepseudo-code of FIG. 3B is an example implementation of the awarenessalgorithm, which is also illustrated in FIG. 3A. The process foracquiring awareness may be represented by rules in the database, and thedatabase may also store an awareness special symbol whose definitionincludes these rules.

The nature of the awareness capability represented by the awarenessalgorithm of FIGS. 3A and 3B is illustrated using FIG. 13 whichillustrates an example of using the awareness algorithm to acquireawareness of a normal symbol. Primitive definitions are circled in FIG.13 to assist with identification. In the example of FIG. 13, theinformation system acquires awareness of symbol S₁₀ from the data storeusing the awareness capability illustrated in FIGS. 3A and 3B. Theinterpreter may use the awareness algorithm illustrated in FIGS. 3A and3B to generate the meaning of a symbol S₁₀, thereby acquiring awarenessof S₁₀. Item 1300 represents the original invocation of process 300 forsymbol S₁₀. The interpreter may obtain the definition D₁₀ of S₁₀ fromthe data store which includes three symbols S₂₁, S₁₂, and S₂₃. Thisdefinition is not primitive, so the interpreter may invoke the awarenessalgorithm for the first symbol S₂₁. This iteration is marked by item1301 in FIG. 13. The interpreter may obtain the definition D₂₁ forsymbol S₂₁, which includes the symbols S₅ and S₁₄. Because thisdefinition is also not primitive, the interpreter may use the awarenessalgorithm to obtain the definition of the first symbol S₅. Thisiteration is marked as item 1302 in FIG. 13. The interpreter may obtainthe definition D₅ for symbol S₅ from the database. This definition isprimitive because the definition is the S₅ symbol itself. Theinterpreter may return the definition of S₅ as a meaning for S₅ toiteration 1301. The returned symbol (e.g., S₅) is concatenated to themeaning of S₂₁, and the interpreter determines whether the definitionfor S₂₁ is fully expanded. Because S₁₄ has not been expanded, theinterpreter calls the awareness algorithm for S₁₄, invoking iteration1303 of FIG. 13. The definition of S₁₄ is not primitive, thus causingthe interpreter to invoke iterations 1304 and 1305. When the meaning ofS₁₄ is fully expanded, for example to <S₁₆, S₁₇>, this meaning is passedback to iteration 1301, which passes the meaning of S₂₁, namely <S₅,S₁₆, S₁₇>, to iteration 1300. This iterative process continues untiliteration 1300 receives the meaning of S₁₂ (namely <S₁₈, S₁₉>) and S₂₃(namely <S₁₁, S₃₀>). As each meaning is returned it is concatenated toform the meaning of S₁₀. Thus, the interpreter determines that themeaning M₁₀ of S₁₀ is <S₅, S₁₆, S₁₇, S₁₈, S₁₉, S₁₁, S₃₀>. By determiningthe meaning of S₁₀, the descriptive self has become aware of S₁₀.

As illustrated above, omniphysical mind gains awareness of a symbol byestablishing its meaning in the defined terms of the system using thealgorithm of awareness. We can represent that capability of awareness byan awareness special symbol, e.g., S_(AWARE). As with any symbol, theself can become aware of this symbol by establishing its meaning Thatis, by applying the algorithm of awareness to S_(AWARE), it becomesaware of its capability of awareness. The particular rules by which asymbol's definition is fully expanded may collectively be referred to asthe awareness algorithm, discussed above with regard to FIGS. 3A and 3B.In some implementations the awareness algorithm may be represented by aspecial symbol, for example the S_(ALGO) symbol of FIG. 12B. Just as itcan for any symbol, the system may use the algorithm of awareness toestablish the meaning of S_(AWARE) by fully expanding its definition.Representing the capability of awareness, the meaning of S_(AWARE) isjust the means of its awareness, namely the algorithm of awareness asrepresented by S_(ALGO). In determining the meaning of S_(AWARE), thesystem becomes aware of the process by which it becomes aware, e.g., asrepresented in the processing rules in the database. Thus, the systemgains awareness of its capability to be aware. We can represent theability of the system to be aware of its capability of awareness asS_(AWARE/ALGO) (e.g., applying the algorithm of awareness to theS_(AWARE) special symbol). We know that the descriptive self's awarenessof its awareness is accurately grounded since the self uses the actualmeans of its awareness to be aware of its awareness.

FIG. 14 is an example of the system acquiring awareness of being awareusing the awareness algorithm illustrated in FIGS. 3A and 3B. The systembecomes aware of being aware by determining the meaning of the keysymbol S_(AWARE). Thus in the example of FIG. 14, S_(AWARE) is theparameter symbol for process 300. The interpreter obtains the definitionD_(AWARE) from the database, which is the symbol S_(ALGO), the symbolrepresenting the algorithm of awareness. The definition of S_(ALGO) maybe the processing rules that comprise the awareness algorithm. Thus, themeaning of S_(AWARE) (represented by M_(AWARE) in FIG. 14) is the fullyexpanded definition of S_(ALGO) which are the processing rules R₂₉, R₃₀,R₃₁.

Acquiring awareness of the descriptive information and capabilities ofthe system is accomplished in a similar manner using a database specialsymbol. The database special symbol, such as S_(SYSTEM) in FIG. 12B,represents the content and capabilities of the system. By gainingawareness of the meaning of this symbol, the system is able to be awareof its content and capabilities. We represent the system's ability to beaware of its content and capabilities as S_(SYSTEM/ALGO) (e.g., applyingthe algorithm of awareness to the contents of the database). It isunderstood that the meaning of S_(SYSTEM) may be determined bydetermining the meaning of each symbol in the data store using theawareness algorithm. In other words, using the examples of FIGS. 13 and14 it is apparent how the system may reduce any of the contents ofS_(SYSTEM) to primitives, to establish the meaning of S_(SYSTEM).

The descriptive self may acquire several forms of awareness. Previously,the symbol S_(AWARE) was introduced, enabling the system to be aware ofany of its content. As seen previously, S_(AWARE/ALGO) may represent thecapability of the system to be aware of its awareness. TheS_(AWARE/ALGO) symbol is an example of an aware of awareness symbol. Anaware of awareness symbol may be another special symbol. The system mayinclude an unlimited number of aware of awareness symbols, eachrepresenting a level of being aware of being aware. At a primary orinitial level, the aware of awareness symbol is defined so that itsmeaning is the computational means by which the system becomes aware ofits being aware. Just as it can for any symbol, the system can gainawareness of this symbol (e.g., S_(AWARE/ALGO)) by computing itsexpanded definition, thus becoming aware of its awareness of itsawareness which can be represented by S_(AWARE/AWARE/ALGO). The systemmay generate any degree of awareness of its awareness by theintroduction of an appropriate symbol and the application of theawareness algorithm by which the system gains awareness of any symbol.

The system may also acquire awareness of its being aware of the meaningof a particular symbol. In this form of awareness, the system is awareof its capability to be aware of a particular symbol's meaning. In otherwords, the system is aware of its capability to establish the meaning ofa particular symbol. For example, the system may have a symbol awarenesssymbol that is defined so that its meaning is the capability thoughwhich the system gains awareness of a particular symbol, or theawareness algorithm applied to the particular symbol. For example, thesystem may include any number of normal symbols generally designated bysymbol S₁₀ and another symbol S_(AWARE/10), where the meaning of theS_(AWARE/10) symbol is the capability though which the system gainsawareness of the S₁₀ symbol. This meaning may also be represented byS_(ALGO/10) using a parameter of S₁₀. By generating the meaning ofS_(AWARE/10) the system becomes aware of its capability of being awareof symbol S₁₀. Because the particular description of which the system isaware is arbitrary and because the system uses the same algorithm togain awareness of any description, the approach can be applied to any ofthe system's symbols, including the special symbols and normal symbols.The descriptive self can represent the system's capability to be awareof its awareness of any of its symbols by the symbol S_(AWARE/10/ALGO).

Self-Initiate Capability

FIG. 4 is a flowchart illustrating example rules supporting aself-initiate capability, according to an implementation. The rulessupporting the self-initiate capability may be associated with aself-initiate special symbol, the meaning of which is rules representedby process 400. In some implementations, the interpreter may initiatethe self-initiate capability by placing the self-initiate special symbolin the processing queue, for example as in step 220 of FIG. 2A. Thisspecial symbol represents the system's ability to maintain its selfdom.The self-initiate capability allows the system to be aware andself-aware as a result of its own internal operations. It does this bycalling into awareness the special symbols enabling the self to be fullyself-aware, that is, by being aware both of its capability of awarenessas well of all of its content and capabilities. The first is theawareness special symbol representing the system's capability ofawareness (e.g., S_(AWARE)). By becoming aware of meaning of thissymbol, the system becomes aware of its capability of awareness. We canrepresent the ability of the system to be aware of its capability ofawareness as S_(AWARE/ALGO). The other is S_(SYSTEM), the special symbolrepresenting the content and capabilities of the system. By gainingawareness of the meaning of this symbol, the system is able to be awareof its content and capabilities. We represent the system's ability to beaware of all of its content and capabilities as S_(SYSTEM/ALGO). Theself-initiate process 400 may draw on a self-initiate queue (Q_(S)). Theself-initiate queue may be a data structure in memory filled by thesespecial symbols giving rise to self-awareness.

For example, process 400 may begin with rules that cause the system toempty the processing queue and the input queue (405). While theself-initiate capability may be called in the absence of inputs, it mayalso be called in the presence of improper or invalid inputs, asexplained in more detail with regard to FIGS. 5 and 7. Accordingly, theprocessing queue and/or input queue may have entries that are not to beprocessed further so as to preserve the content of the system. Emptyingthe queues in such circumstances ensures the entries are not processedin ways that could harm the system. The rules may cause the system tofetch an awareness special symbol from the self-initiate queue (410).The awareness special symbol is a symbol-based representation that thesystem has the capability of awareness. That is, the awareness specialsymbol represents that the system has the ability to establish asymbol's meaning by fully expanding the symbol's definition. TheS_(AWARE) symbol of FIG. 12B is one example of an awareness symbol. Theparticular rules by which a symbol's definition is fully expanded maycollectively be referred to as the awareness algorithm, discussed abovewith regard to FIGS. 3A and 3B. In some implementations the awarenessalgorithm may be represented by a symbol, for example the S_(ALGO)symbol of FIG. 12B. The rules may cause the system to generate themeaning of the awareness special symbol (415). Just as it can for anysymbol, the system may use the algorithm of awareness to fully expandthe definition of S_(AWARE). In determining the meaning of S_(AWARE),the system becomes aware of the process by which it becomes aware, e.g.,as represented in the processing rules in the database. Thus, the systemgains awareness of its being aware. Although the example of FIG. 12Buses a symbol S_(ALGO) to represent the algorithm of awareness, in someimplementations the S_(AWARE) symbol may represent the algorithm ofawareness. In other words, the definition of S_(AWARE) may be “R₂₉, R₃₀,R₃₁ ^(”) or any definition that fully expands to the rules defining thealgorithm of awareness. In either case, applying the algorithm ofawareness to the awareness symbol allows the system to acquire awarenessof its being aware.

The rules may also cause the system to fetch a database special symbolfrom the self-initiate queue (420). The definition of the databasespecial symbol represents all the data of the data store, includingrules, normal symbols, special symbols, and categorization schemesymbols, and their definitions. The rules may cause the system togenerate the meaning of the database special symbol (425). Generatingthe meaning of the database special symbol may enable the system toacquire awareness of its content, including its capabilities. Thus, oncethe system acquires awareness of its being aware (e.g., step 415) andawareness of all of its information (e.g., step 425), it is self-aware.Thus, awareness of its information is a second requirement for theinformation system to have self-awareness. All of the content andprocessing capabilities of the system are either themselves primitivesor expressible as primitives. A symbol is primitive if its definition isthe symbol itself (for example in FIG. 12A, S₁=D₁(S₁)) or the symbol isdesignated as primitive, such as rules and belong-to-category symbols.Other symbols, such as S_(SYSTEM), S_(AWARE), and S₁₀₂, are notprimitives because their definitions are comprised of other symbols.Each of their definitions can be fully expanded until the meaning of thesymbol is expressed in terms of primitives. For example, S_(SYSTEM)represents the entire contents of the database. The system is able togain awareness of its own content and processing capabilities byestablishing the meanings of those contents. It does this by applyingthe algorithm of awareness to fully expand the definition of any of thecontents of its data store. We use the symbol S_(SYSTEM/ALGO) torepresent the ability of the system to be aware of the contents of itsdata store—the meanings of its symbols, definitions, preference sets,reference lists, and processing rules.

Format Capability

FIG. 5 is a flowchart illustrating example rules supporting a formatcapability, according to an implementation. The rules supporting theformat capability may be represented by process 500. The formatcapability enables the system to determine if the format of the input isappropriate for processing. If the input is appropriate for processing,the format capability may determine whether the input requests adecision or not, may determine whether the input requests reporting ofinformation or not, and initiate the appropriate capability to handlethe input. The format capability may be represented by a format specialsymbol, whose definition contains the symbols representing the processesby which the format of an incoming symbol is checked for systemcompatibility. The meaning of the definitions is the rules supportingthe format capability. In some implementations, the interpreter mayinitiate the format capability by placing the format special symbol inthe processing queue, for example as in step 215 of FIG. 2A. The inputprocessed in the format capability represents information from anexternal environment. To be processed by a self existing in descriptiveterms, that information must be descriptive. Inputs could arise directlyfrom descriptive sources or could arise from physical sensors whoseinformation has been transformed into descriptive information termsprior to being placed on the input queue.

The format capability may begin with rules that cause the system tofetch the input from the input queue (505). The rules may then cause thesystem to determine whether the format of the input is acceptable (510).Determining whether the format is acceptable may in itself involve otherspecial symbols. For example, the system may include a special symbolfor each format check performed on the input. In one implementation, afirst format check may include a first rule to determine whether theinput includes three portions: a symbol, its definition, and itspreference set. A preference set includes a utility for the symbol and aprivacy rating. The utility may represent a preference accorded to thesymbol and may be numeric. The privacy rating may represent the degreeof confidentiality accorded to the symbol and may be numeric. A utilityor privacy rating for a symbol may include a null value, indicating thatno numeric value has been assigned. In some implementations, the nullvalue can be the word “null” or a numeric value that is not a validutility or privacy rating. Special symbols (e.g., for special symbols,such as the decision special symbol) are assigned a utility of null butmay have a non-null value for the privacy index. If the input is doesnot include the three portions for the symbol, its definition, and itpreference set, the input is not acceptable.

The first format check may also include a second rule to determinewhether any of the portions is empty. If any portions are empty, theinput is not acceptable. A third rule may determine whether the firstportion includes one symbol. If the first portion includes more than onesymbol, the input is not acceptable. If the input is not acceptable(510, No), the rules associated with the first format check may put theself-initiate special symbol in the processing queue (515), which causesthe system to reject the input by initiating the self-initiatecapability.

If the input is acceptable for processing (510, Yes), the rules may putcall the safety capability (520). The safety capability may provide aninfrastructure allowing the system to reject harmful or dangeroussymbols from the system before they are stored in the content orprotected portions of the data store. In some implementations, the rulesmay call the safety capability by placing the S_(SAFETY) symbol in theprocessing queue. The safety capability is discussed in more detail withregard to FIG. 7. If the input fails to pass the safety check (525, No),process 500 ends. As discussed in more detail with regard to FIG. 7,this may occur because the rules call the self-initiate capability byplacing the self-initiate special symbol in the processing queue, whichhas the effect of cancelling the format capability.

If the input does pass the safety check (525, Yes), the rules may causethe system to determine whether the input is a report request (530). Inone implementation, the system may determine whether the symbol in thefirst position of the input is a report request special symbol which thesystem requests a report of the content of the system. For example, thesystem may determine whether the symbol in the first portion of theinput is S_(REPORT-REQUEST). If so (530, Yes), the rules may cause thesystem to put a report content special symbol in the processing queue(535). The report content special symbol (e.g., S_(RC)) represents thatthe system has the ability to provide the normal symbols, includingtheir preference sets and their values, to an external interface, and isdiscussed in more detail with regard to FIG. 11.

If the input does not request reporting content (530, No), the rules maycause the system to determine whether the input requests a decision(540) in the form of evaluating alternatives as the underlying basis fora decision. For example, in one implementation the system may determinewhether the symbol in the first portion of the input is a decisionspecial symbol by which the system requests decisions (e.g., a decisionspecial symbol). For example, the system may determine whether thesymbol in the first portion of the input represents a decision makingrequest (S_(DMR)). If so (540, Yes), the rules may cause the system toput a decision making process special symbol (e.g., S_(DMP)) in theprocessing queue (545). The decision making special symbol representsthat the system has the ability to make decisions based on itsrequirements and make the best choice according to its preferences, andis discussed in more detail with regard to FIG. 6. If the input does notrequest a decision (540, No), the system may determine whether thesymbol from the first portion of the input is already in the data store(550). If the symbol is already in the database (550, Yes), the systemmay generate the meaning of the definition from the input from the datastore, acquiring awareness of the symbol (555). After generating themeaning of the input symbol, the system may determine whether themeaning is the same (560). In other words, the system may compare themeaning of the input symbol with the meaning of the original symbol inthe data store. In some implementations, the system may determine themeaning of the original symbol as part of step 555. If the meaning ofthe inputted symbol is different (560, No), the system may consider theinput invalid as a symbol cannot change its meaning Thus, the system mayput the self-initiate special symbol in the processing queue (515).

If the meaning is the same (560, Yes), the system may determine whetherthe preference set for the input has changed (560) by comparing thethird portion of the input with the preference set for the OMSS of thesymbol in the data store. If the preference set has changed (565, Yes),the system places S_(UPS) in the processing queue, which will invoke theprocess that updates the preference set for a symbol. If the symbol is anew symbol that is not already in the data store (550, No), the rulesmay cause the system to initiate a categorization capability, forexample by placing a categorization special symbol (e.g.,S_(CATEGORIZE)) in the processing queue (575). The categorizationspecial symbol may represent the process of categorization, e.g., thecategorization capability, and the rules may cause the system to put thecategorization special symbol in the processing queue (575) to initiatethe categorization process, e.g., via the interpreter. With symbols inthe processing queue, the format capability may end, allowing theinterpreter to handle the input in accordance with FIG. 2A, for example.

Decision Capability

FIG. 6 is a flowchart illustrating example rules supporting a decisioncapability, according to an implementation. The rules supporting thedecision capability may be represented by process 600. Using thedecision capability, the descriptive self is able to make optimaldecisions based on its self interest. The self generates solutions thatmeet its requirements and then chooses the preferred solution from amongthose. The requirements may include attributes that a solution mustpossess as well as those that the solution must not possess. From amongthe solutions that meet the requirements, the self is able to choose theone which ranks highest in terms of its preferences. As a capability ofthe infrastructure, the decision process is completely general, able tobe applied for any requirements, attributes, and preference sets.

The decision making capability of the descriptive self mirrors a humanapproach to decision making, one that is consistent with and ultimatelybased on utility maximization but which is structured to reducecomputational demands. For example, while it is possible to compute theutility of the entire universe of options as the basis of arriving at adecision, the ‘requirements approach’ truncates the process byeliminating from consideration requirements with low or negativeutility. For example, when deciding where to eat lunch when located at aparticular point one could calculate the utilities of the universe ofoptions: all places purveying food in Paris, Milan, Bermuda, etc.; thevarious means of purveyance: food cart, cafeteria, restaurant, etc.; themeans of getting there; taxi, walk, swim, etc. Instead of making all thepossible computations the requirements approach, employed by humans,deploys requirements which eliminate options whose preference/utility inthe particular choice situation is so low/negative as to be foreclosedas options. Thus, we set requirements which reflect underlyingpreferences such as: the food must be within one-half mile of thepresent location; lunch must cost less than $30; I must be able to walk,etc. These requirements produce a choice set from which the ultimatechoice based on explicit utility calculations is made.

The data store of the descriptive self may be structured to support thedecision making capability. For example, the normal symbols stored inthe ‘read-write’ or content portion of the data store may be associatedwith (among other things) its definition; its categorization; and itspreference set (utility and/or privacy). In some implementations, thisinformation may be stored in an OM symbol structure for the symbol. Inaddition, a symbol may also be associated with a reference list, i.e., alist of all other normal symbols that contain the symbol in theirdefinitions and/or the memory address of each of those symbols. Thisinformation may also be included in the OM symbol structure. Thesefeatures of the OM symbol structure may support both the selection ofchoices meeting requirements as well as the choice among qualifiedsolutions. For example, a decision requirement may specify that eachsolution includes content represented by S₁. By accessing the OMSS of S₁(e.g., the reference list), the system can produce all symbolscontaining S₁ in their definition, which is the list of symbols meetingthat requirement. The capability enables any number of attributes thatmust either be included or be excluded, the ability to assemble allsolutions meeting the requirements, and the ability to choose from amongthat set of solutions the one with the highest utility.

As discussed above, input that is appropriate for processing has threeportions, the first portion including a single symbol. In the case ofinput that requests a decision, the first symbol may be a decisionspecial symbol recognized by the system as a request for a decision, forexample S_(DMR). The second portion of the input is a definition thatincludes positive and negative decision requirements. A positivedecision requirement is one that must be part of any solution while anegative decision requirement indicates what must be excluded from anysolution. Positive requirements appear before a special separator symbolS_(RS) while negative decision requirements appear after S_(RS). Adecision request may include any number of positive or negativerequirements and a negative requirement is optional. Each requirement isrepresented by a normal symbol. In some implementations, the positiverequirements may be one or more normal symbols separated by a delimiter.Thus, positive requirements portion may include one or morerequirements. A negative requirement represents one or more normalsymbols that cannot be present in the preferred solution. The negativerequirement portion is optional and any negative requirements may followa separator special symbol (e.g., S_(RS)).

The system recognizes the decision special symbol as a request toevaluate the requirements represented in the request based on theutility of proposed solutions make a decision among the solutions. Eachnormal symbol may have a utility component. A decision making specialsymbol, for example S_(DMP), may represent the decision capability. Itsdefinition is the algorithm by which the system determines solutioncomponents that correspond to the requirements, determines potentialsolutions from the solution components, ranks the potential solutions,and selects a potential solution with the greatest utility. Its meaningis the rules of the algorithm. In some implementations, the interpretermay initiate the decision capability by placing the decision makingspecial symbol in the processing queue, for example as in step 545 ofFIG. 5.

The decision capability may begin with rules that cause the system tofetch the positive requirements portion of the input, e.g., from thesecond portion of the input (605). The rules may cause the system to getthe next symbol in the first requirement (610). This symbol represents acurrent request symbol. The rules may then use the current requestsymbol to obtain the normal symbols from the data store whose definitionincludes the current request symbol (615). In some implementations, thismay include using the reference list of an OM symbol structure. Forexample, the system may look in the reference list portion of the OMsymbol structures for symbols that include the current request symbol intheir definition. For each match, the system may store the matchingsymbol as one solution component for the first requirement. The systemmay also store the current request symbol itself as a solutioncomponent. The current request symbol and each symbol in a referencelist for the current request symbol may be considered a separatesolution component for the first requirement. Thus, for example, step615 may result in five symbols that are potential solution options.

The rules may cause the system to determine if the negative requirementportion has been reached (620). If it has not (620, No), the system maydetermine if there is another positive requirement (e.g., whether theend of the positive requirements has been reached) (625). If the end ofthe positive requirements has not been reached (625, No), the rules maycause the system to get the symbol for the next requirement as thecurrent request symbol (610) and look for solution components for thisnext request (615) as described above. The second requirement may alsohave a number of solution components. The rules may cause the system tocontinue determining solution components for each requirement until theend of the positive requirements is reached (625, Yes) or a negativerequirement is encountered (620, Yes).

If the system encounters the optional negative requirement (620, yes),the rules may cause the system to get the next symbol in the input(e.g., the symbol following the S_(RS) symbol) (630). Symbols followingthe separator special symbol S_(RS) are negative requirements that willbe used to eliminate solution components. For example, the rules maycause the system to inspect the solution components identified (e.g.,during step 615 for each requirement) and eliminate any solutioncomponent that includes the exclusion symbol (635). If there is anothersymbol in the negative requirement (640, No), the rules may cause thesystem to get the next symbol in the negative requirement (630) andrepeat the inspection of solution components, removing those thatinclude this next exclusion symbol (635). This continues until the endof the request (640, Yes).

When the symbols of the request have been processed (625, Yes) or (640,Yes), the system has a quantity of solution components for each positiverequirement in the decision request. The rules may cause the system togenerate a series of possible solutions, e.g., solution combinations(645). Each possible solution may include one solution component foreach requirement. Thus, for example, if requirement 1 has 3 solutioncomponents, requirement 2 has 2 solution components, and requirement 3has 4 solution components, the rules may cause the system to generate3×2×4 possible solutions. When all permutations of the solutioncomponents from the requests have been generated (650, Yes), the rulesmay cause the system to calculate a utility for each possible solution(655). The utility may be the sum of the utility components for thesymbols that make up the possible solution. As indicated previously,each normal symbol may have an associated utility included in thepreference set. In some implementations, the system may select thepossible solution with the highest utility (660) and report thesolution.

With the solution representing the result of the decision reported out,process 600 ends. It is understood that FIG. 6 represents one example ofa decision capability, and that the system may include other similardecision capabilities, such as a decision capability for determining asymbol with a lowest utility from among a plurality of requirements,and/or a decision capability for determining whether two requirementshave equivalent utility, etc. It is also understood that implementationsmay include positive requirements separated by a delimiter and eachrequest may include more than one normal symbol.

An example of the decision capability for an example request{S₁₀₁S₁₀₃S_(RS)S₁₀₄} and the data store of FIG. 12A follows. The examplerequest represents the second portion of the input that requests adecision, e.g., via an S_(DMR) special symbol. The decision capabilitymay first get the positive requirement of the request, namely S₁₀₁. Thisrepresents the current request symbol. The system may look for symbolthat includes the definition of the current request symbol in theirdefinition. In some implementations, such symbols may be associated withthe current request symbol, for example in a reference list of an OMsymbol structure. Thus, the system, by accessing the OM symbol structurefor the current request symbol, can determine the solution componentsfor the first request. Of course, it is understood that the system mayalso query the data store for symbols that include the definition of thecurrent request symbol in their definitions. As illustrated in FIG. 12A,the S₁₀₁ symbol has one symbol in its reference list, namely S₁₀₂. Thus,the system determines that the solution components for the firstrequirement are S₁₀₁ and S₁₀₂. The system has failed to reach the end ofthe positive requirements, so the system may get the next positiverequirement, namely S₁₀₃. The system may look for symbols that includethe symbols of the definition of S₁₀₃ in their definition, as discussedabove. FIG. 12A illustrates that S₁₀₃ has one symbol in its referencelist, namely S₁₀₄. The system may accordingly determine that thesolution components for the second requirement are S₁₀₃ and S₁₀₄.

The system may determine that it has reached the optional negativerequirement component (e.g., designated by the special symbol S_(RS)).The system may read the normal symbol following the special symboldesignating a negative requirement, in this example symbol S₁₀₄. Thissymbol is an exclusion symbol, meaning that any solution component thatincludes S₁₀₄ should be removed from the set of solution components. Thefirst set of solution components do not includes S₁₀₄, but the set forthe second requirement does. Thus, the system may remove S₁₀₄ from thesecond set, leaving the set to include just one solution component,namely S₁₀₃.

The system may then determine that the end of the requirements has beenreached (as no more symbols are in the request. The system has thusdetermined two sets of solution components, {S₁₀₁, S₁₀₂} and {S₁₀₃}. Thesystem may select one component from each set to generate a potentialsolution. For example, the system may determine the potential solutionsfor the given sets of solution components are {S₁₀₁, S₁₀₃} and {S₁₀₂,S₁₀₃}. The system may calculate a utility for each potential solutionbased on the utility of the solution components. In someimplementations, the utility may be the sum of the utility component foreach symbol in the possible solution. Using the example of FIG. 12A, theutility for {S₁₀₁, S₁₀₃} is S_(U101)+S_(U103). Of course, utility mayalso be calculated by multiplication, averaging, or some othercombination of the symbol utilities. Similarly, the system may determinethat the utility of the second possible solution {S₁₀₂, S₁₀₃} isS_(U102)+S_(U103). The system may select the possible solution with thehighest utility and report the solution.

Safety Capability

FIG. 7 is a flowchart illustrating example rules supporting a safetycapability, according to an implementation. The descriptive selfinteracts with its external descriptive environment. This includesprocessing new symbols and new preference sets for existing symbols. Aspart of processing input symbols, which may be new or existing symbols,the rules associated with the safety capability provide aninfrastructure allowing the system to reject harmful or dangeroussymbols from the system before they are stored in the content orprotected portions of the data store. The safety capability is oneaspect of persistence. The safety capability may be represented by asafety special symbol. The definition for the safety special symbol isthe algorithms through which the system compares the meaning of an inputwith a list of prohibited symbols and/or ensures that any meaning is notrepresented by more than one symbol. The meaning of the safety specialsymbol is the rules of the algorithm. In some implementations, theinterpreter may initiate the safety capability by placing the safetyspecial symbol in the processing queue, for example as in step 520 ofFIG. 5.

The safety capability may begin with rules that cause the system tofetch the definition of the input symbol from the input queue (705). Forexample, the input symbol may be on the input queue and the rules maycause the system to fetch the input symbol and its definition from theinput queue and determine if any symbols in the definition are notcontained in the data store (710). If yes, the rules may then cause thesystem to determine if the symbol is primitive (715) (i.e., if themeaning is the same symbol as the definition). If the input symbol isnot primitive (715, No), the system is unable to determine the meaningbecause one or more of the symbols in the definition is not already inthe data store, and the rules may cause the system to reject the inputby initiating the self-initiate capability. For example, the system mayput a self-initiate special symbol in the processing queue (760). Thesafety capability then ends, allowing the interpreter to process theself-initiate special symbol, including clearing the rejected symbolfrom the input queue, in accordance with FIG. 2A, for example. If theinput symbol is primitive (715, Yes), process 700 ends because primitivesymbols are not harmful and the system has already determined the symbolis not already in the data store.

If the definition includes only symbols already in the data store (710,No), the rules may cause the system to generate the meaning of the inputsymbol (720). The rules may also retrieve a list of prohibited or unsafesymbols and their meanings and compare the meaning of the input symbolwith the meaning of the first symbol in the list of prohibited symbols(725). In some implementations, this list may be represented by a dangerlist symbol, e.g., D_(Danger) illustrated in FIG. 12A. In general, theprohibited symbols include any symbol whose meaning is a process thatalters any of the special symbols. The safety capability may cause thesystem to compare the meaning of each symbol in the list of prohibitedsymbols to the meaning of the input symbol. If the meaning of a symbolfrom the prohibited list matches the meaning of the input symbol (730,Yes), the safety capability may cause the system to initiate theself-initiate capability, thus rejecting the input symbol. For example,the system may put a self-initiate special symbol in the processingqueue (760). The safety capability then ends, allowing the interpreterto process the self-initiate special symbol, including clearing therejected symbol from the input queue, in accordance with FIG. 2A, forexample.

If the meaning of the input symbol does not match the meaning of thesymbol from the prohibited list (730, No), the safety capability maycause the system to select the next symbol in the prohibited list (735,Yes) and repeat the steps 725 to 730, comparing the meaning of the nextsymbol in the list of prohibited symbols to the meaning of the inputsymbol. If all symbols in the prohibited list have been examined (735,No), the safety capability may cause the system to compare the meaningof the input symbol with the meaning of a first symbol in a list ofexisting normal symbols and their meanings (740). In someimplementations the list of existing symbols and their meanings may berepresented by a list symbol, such as D_(Exist) illustrated in FIG. 12A.

If the meaning of the input symbol does not match the meaning of thefirst symbol from D_(Exist) (745, No), the rules may cause the system toget a next symbol from the list (755, Yes) and repeat steps 740 and 745.If all symbols in D_(Exist) have been examined (755, No), the safetycapability may end, having verified the new symbol does not have thesame meaning as an existing symbol and is not harmful to the system.

If the meaning of the input symbol does match the meaning of a symbol inD_(Exist) (745, Yes), the rules may cause the system to determine if thesymbols are the same (750). Put another way, the system may determine ifthe input symbol is already in the data store. If the two symbols arethe same (750, Yes), the safety capability ends, having verified theinput is not creating a new symbol with an existing meaning. If theinput is a different symbol with the same meaning as an existing symbol,the system may reject the input symbol. For example, the system mayplace a self-initiate special symbol in the processing queue (760),which will clear the rejected symbol from the input queue, as explainedabove.

Categorize Capability

FIG. 8 is a flowchart illustrating example rules supporting acategorization capability, according to an implementation. It isunderstood that the categorization scheme illustrated in FIG. 8 is oneexample, and implementations are not limited to the categorizationscheme illustrated. As discussed above, processing new symbols with newdefinitions allows the descriptive self to grow from its initial state,e.g., to interact with an external environment and increase itsinformation content. When the descriptive self receives a new symbol, itmay categorize the new input into an existing categorization scheme. Insome implementations, the scheme may be a hierarchical, e.g., organizedin a tree structure. In such an implementation, more general categoriesare in the top level, or tier one, a tier closest to the root. In someimplementations, categories within a tier are defined so as to bemutually exclusive. Each of the tier one categories may have zero ormore children, or subcategories. The children of tier 1 categories aretier 2 categories. Each of these may have zero or more children, orsubcategories, etc. In some implementations, when a subcategory includesonly primitive symbols (e.g., symbols whose meaning is the same as itsdefinition), no further subcategories may be possible. In such animplementation, the categories are reducible to primitives and thus theleaves of the categorization tree are primitives.

The categorization capability enables the system to determine whichcategories in the category scheme a symbol belongs to. If a symbol doesnot evaluate into existing categories, the categorization capability mayallow the system to expand the categorization scheme to accommodate thenew information. For example, when the input is not capable ofcategorization within the existing structure, the system is capable ofcreating new categories and/or subcategories to incorporate the symboland its definition into the scheme. The categorization capability is anaspect of content processing. The capability of the system to categorizenormal symbols into the categorization scheme may be represented by acategorization special symbol. The definition for the categorizationspecial symbol is the algorithm through which the system compares themeaning of an input against a categorization scheme, determines wherewithin the scheme the input exists, including adding new categoriesand/or subcategories when necessary, and records the determination inthe data store. The meaning is the rules underlying the algorithm. Insome implementations, the interpreter may initiate the categorizationcapability by placing the categorization special symbol in theprocessing queue, for example as in step 575 of FIG. 5.

The categorization capability may categorize a validated input, e.g., aninput that has passed the formatting requirements of the formatcapability, e.g., as represented by the format special symbol. Asdiscussed above, the input appropriate for processing may include threeportions. The first portion includes the symbol to be categorized, thesecond portion includes a definition for the symbol, and the thirdportion includes a preference set for the symbol. The utility may benull and the privacy rating may be preset for special symbols andcategorization scheme symbols. The symbols of the definition from thesecond portion of the input may be ordered from most general to leastgeneral. The object of the categorization capability is to determine amembership tag for the symbol, the membership tag representing eachcategory and sub-category that the symbol belongs to. The membership tagmay represent a path in the categorization scheme, for example from theroot to one or more of the leaves. The membership tag may be appended tothe definition of the symbol, which results in a categorized definition.The categorized definition may be stored in the data store.

The categorization capability may include rules that cause the system toinitialize the membership tag for the symbol (805). For example, thesystem may start with an empty string for the membership tag, as oneexample. In some implementations, the membership tag may be appendeddirectly to the end of the definition for the symbol. Thus, at thebeginning of the categorization process the membership tag is assumed tobe empty. The rules may cause the system to determine the meaning of thesymbol, for example, expanding the definition from the second portion ofthe input (810). As explained above, the meaning is the definition ofthe symbol reduced to primitives.

The rules may cause the system to begin to categorize the symbol intothe categorization scheme, for example walking the categorization tree.The categorization scheme, e.g., the categorization tree, may beexpressed in terms of categorization scheme symbols in the data store.FIG. 9 illustrates one example of a category tree, represented in termsof categorization scheme symbols and their corresponding definitions. Inthe example of FIG. 9, a special category symbol, S_(CATEGORY)represents the root of the category tree. The definition D_(CATEGORY) ofthe special category symbol includes categorization scheme symbols thatrepresent each node in the first tier of the category tree. Thus, thenumber of symbols in the definition D_(CATEGORY) of the special categorysymbol represents the number of tier one categories. In the example ofFIG. 9, the number is represented by n, which can by any non-zeronumber.

The nodes may be represented by categorization scheme symbols thatindicate the path and the index of the node. The path may representwhich parent nodes, e.g., ancestors, the current node has and the indexmay indicate the current nodes' position among the children of itsparent. For example, node 905 of FIG. 9 has a path of 1 which indicatesthat its parent is the first node of tier 1 of the categorizationscheme. A path of 0 indicates no ancestor category exists, e.g., becausethe root of the tree is not a category. Thus a path of 0 indicates atier 1 node. Node 905 of FIG. 9 has an index of 2, which indicates it isthe second child of this parent node. The definition for node 905includes the symbols S₄ and S₃ and categories 1 to n. The symbols S₄S₃are the tag portion of the definition for the category node (i.e. thecategorization scheme symbol that represents the node). The tag portionof a definition for a category node contains normal symbols thatdetermine the membership of a symbol in the category. In the example ofNode 905, normal symbols that are members of the first category of tier1 and include the symbols S₄ and S₃ in their meanings are members of thecategory represented by node 905. The categorization scheme symbols inthe definition for node 905 represent the children of node 905. Thus,node 905 has children 1 to n, where n represents any non-zero number

Node 910 of FIG. 9 is a child of node 905. Its path is 12, indicatingthat its parents are the first node of tier 1 and the second child ofthe first node of tier 1. Its index is also 2, indicating it is thesecond child of the second child of the first node of tier 1. Thedefinition of node 910 includes categories 1−z, where z is anynon-negative number (including zero, so that node 9010 may have onechild). Node 915 of FIG. 9 has a path of 11 and an index of 1. Thisindicates that its parents are the first node of the first tier and thefirst child of the first node of the first tier and that it is the firstchild of the first node of the first tier. The definition of node 915includes only the tag portion with normal symbols, namely S₄S₆. Becausethe definition does not include categorization scheme symbols, the nodehas no children and is a leaf node. Thus, in some implementations, thesymbols in the tag portion of the definition (i.e., S₄S₆) are primitive.It is understood that the categorization scheme of FIG. 9 is illustratedas one example and that variations of this symbol-based categorizationscheme may be used.

Returning to FIG. 8, the categorization capability may cause the systemto initialize a cursor for walking the category tree (815). The cursormay be a memory structure that tracks the current path and the currentindex for the tree. For example, the categorization capability may causethe system to set the current category index to 1 and the current tierpath to null, which indicates that we are working from tier 1—the tierjust below the root of the tree. For example, with the current categoryindex set to 1 and the current tier path set to null, the cursor maypoint to the first category of tier 1, represented, for example, by node920 of FIG. 9. The categorization capability may cause the system tocompare the meaning of the symbol from the input to the meaning of thetag portion of the definition for the current category of the currenttier (820). The tag portion of the definition for the current categoryof the current tier is the portion that includes normal symbols. Therules may cause the system to determine the meaning of the tag portionof the definition before performing the comparison with the meaning ofthe input symbol. In some implementations, the tag portion of thedefinition for the current node may be stored as primitives, sodetermining the meaning has already been done. When comparing themeaning of the input symbol with the meaning of the tag portion of thedefinition of the current node, the system may compare one symbol at atime from the meanings until all symbols in the tag portion havematched, or at least one symbol does not match. If one symbol does notmatch, the two meanings do not match.

If all of the symbols in the meaning of the tag portion of the currentnode (i.e., the node pointed to by the current category of the currenttier) match symbols in the meaning of the input symbol (825, Yes), theinput symbol belongs to the category represented by the current node. Torepresent membership in this category in informational terms, the rulesmay cause the system to append a belong-to-category symbol (e.g., a BTCsymbol) associated with the current category node to the membership tagfor the symbol (850). The BTC symbol is a categorization scheme symboland may represent the category node in the categorization scheme. Insome implementations, it may identify the path and index of the currentnode, thus the system may have a BTC symbol for each category node inthe category tree. The definition of a BTC symbol may be primitive. Inaddition to appending the BTC symbol to the membership tag, the rulesmay cause the system to associate the symbol from the input (e.g., thenew symbol) with other symbols that have the current tag in theirdefinition. In some implementations, this may include updating thereference list of the OM symbol structure of each of the other symbolsto add the new symbol to the reference list.

The rules may cause the system to continue walking the category treeusing the residual symbols in the meaning of the input symbol (860). Theresidual symbols are those symbols that have not yet been matched to themeaning of a tag portion of a category node. If the current node haschildren (865, Yes), the rules may cause the system to append thecurrent category index to the current tier path and to set the currentcategory index to 1 (875). This in effect sets the cursor to the firstchild of the current node, keeping track of the path in the tree thatled to this node. The categorization capability then resumes at step 820with a new current node (e.g., the first child of the old current node).If the current tier does not have children (865, No), the rules maycause the system to add a new child node to the current node (870). Thetag portion of the new child node may be the residual symbols from themeaning of the input symbol. Adding a new category may result in theaddition of a new categorization scheme symbol that represents the newnode, a new BTC symbol for the new node, and a new definition for theparent node (e.g., adding the new categorization scheme symbol to thedefinition of the parent node). Once the new BTC symbol is generated, itmay be appended to the membership tag of the input symbol. Themembership tag may be a concatenation of categorization scheme symbols,e.g., BTC symbols, that are associated with respective categories thatthe symbol belongs to. The rules may cause the system to append themembership tag to the definition of the symbol (880). This categorizeddefinition may be stored with the symbol in the content portion of thedata store. In some implementations, these new categorization schemesymbols (e.g., the new categorization scheme symbol that represents thenew node and the new BTC symbol) may also be placed in the contentportion of the data store. In some implementations, this may includegeneration of an OMSS for the new symbol. A reference list in the OMSSfor a new symbol is empty because the symbol is new so no definitions ofother symbols can include the new symbol. The rules may also cause thesystem to associate the symbol (e.g., the new symbol) with everyprimitive symbol that is in the definition of the new symbol (885). Insome implementations, this may include updating the reference list ofeach primitive symbol with the new symbol. In addition, the system mayadd the new symbol and its definition to the list of existing symbolsand their definitions, which may be represented by D_(Exist).

Returning back to step 825, if the two meanings do not match (825, No),the rules may cause the system to determine whether the current tier hasadditional categories (830). As explained above with regard to FIG. 9,the number of categories of the current tier may be determined by thedefinition of the parent of the current node. If there are additionalcategories in the current tier (830, Yes), the rules may cause thesystem to set to the cursor to the next category, e.g., by increasingthe category index (835). Thus, the current node becomes the nextcategory node. The system may then resume at step 820 with the newcurrent node.

If the current node is the last category of the current tier (830, Yes),the new symbol does not fully evaluate into the existing categorizationscheme. Thus, the rules may cause the system to add a new category tothe current tier (840). Similarly to adding a new child node, adding anew category may result in the addition of a new categorization schemesymbol that represents the new node, a new BTC symbol for the new node,and a new definition for the parent node (e.g., adding the newcategorization scheme symbol to the definition of the parent). Once thenew BTC symbol is generated, it may be appended to the membership tag ofthe input symbol, and the membership tag appended to the definition(880). This categorized definition may be stored with the symbol in thecontent portion of the data store. The rules may also cause the systemto associate the symbol (e.g., the new symbol) with every primitivesymbol that is in the definition of the new symbol (885). In someimplementations, this may include updating the reference list of eachprimitive symbol with the new symbol. In addition, the system may addthe new symbol and its definition to the list of existing symbols andtheir definitions, which may be represented by D_(Exist). Process 800then ends, having completed the categorization capability.

Using the example categorization scheme of FIG. 9, the categorization ofan input symbol, namely {(S₅₆), (D₅₆:S₁, S₂, S₃, S₁₇)} follows. Usingthe categorization scheme of FIG. 9, the interpreter matches the firstsymbol in the meaning of S₅₆, namely S₁, to the first category of thefirst tier, namely S⁽⁰⁾ _(CATEGORY(1)). Thus, the BTC symbol associatedwith the S⁽⁰⁾ _(CATEGORY(1)) symbol, for example S⁽⁰⁾ _(BTC(1)), isappended to the membership tag of the S₅₆ symbol. Because not allsymbols in the meaning of S₅₆ have been matched to a category, theinterpreter may attempt to match the remaining symbols, namely S₂, S₃,S₁₇, to the children of the first node of the first tier. The childrenare tier two categories. In the example of FIG. 9, the interpreter triesto match the first symbol for the S⁽¹⁾ _(CATEGORY(1)) symbol, namely S₂,against the first symbol of the remaining symbols in the meaning of S₅₆.Because S₂ does match the first remaining symbol, the interpreterattempts to match the second symbol, S₃ to the next remaining symbol.These symbols also match, and there are no more symbols in the tagportion of S⁽¹⁾ _(CATEGORY(1)), so the interpreter appends thecorresponding BTC symbol, for example S⁽¹⁾ _(BTC(1)) to the membershiptag of S₅₆.

Because another symbol from the definition of S₅₆ has not been matchedto a category, the interpreter looks to the children of S⁽¹⁾_(CATEGORY(1)), starting with S⁽¹¹⁾ _(CATEGORY(1)). The symbol in thetag portion of the definition does not match, so the interpreter looksfor another category. Another category does not exist in the children ofS⁽¹⁾ _(CATEGORY(1)). Thus, the interpreter adds a new category, forexample represented by S⁽¹¹⁾ _(CATEGORY(2)) and sets the tag portion ofits corresponding definition D⁽¹¹⁾ _(CATEGORY(2)) to the remainingunmatched symbols in the meaning of S₅₆, namely S₁₇. Thus, D⁽¹¹⁾_(CATEGORY(2)) is S₁₇. In addition to this new symbol and it'sdefinition, the interpreter generates a corresponding BTC symbol, namelyS⁽¹¹⁾ _(BTC(2)) and appends this symbol to the membership tag of S₁₇.The interpreter also changes the definition of S⁽¹⁾ _(CATEGORY(1)) toinclude the new category represented by S⁽¹¹⁾ _(CATEGORY(2)). Thus, theupdated D⁽¹⁾ _(CATEGORY(1)) is {S₂, S₃, S⁽¹¹⁾ _(CATEGORY(1)), S⁽¹¹⁾_(CATEGORY(2))}. The categorized definition D₅₆ is {S₁, S₄, S₃, S₁₇,S⁽⁰⁾ _(BTC(1)) S⁽¹⁾ _(BTC(1)) S⁽¹¹⁾ _(BTC(2))}. The categorizeddefinition may be stored in the content portion of the data store alongwith the new category symbol, its associated definition and BTC symbol,and the updated definition of the S⁽¹⁾ _(CATEGORY(1)) special symbol.

Preference Set Update Capability

FIG. 10 is a flowchart illustrating example rules supporting apreference set update capability, according to an implementation. It isunderstood that the rules supporting the preference set updatecapability illustrated in FIG. 10 is one example, and implementationsare not limited to the order or specific rules indicated. Processing newpreference sets for existing symbols allows the descriptive self to growfrom its initial state, e.g., to interact with an external environmentand increase its information content. A preference set for a symbolincludes a utility and a privacy rating. The utility is a measurementused in the decision capability to rank solution combinations and decideon a best solution. Every normal symbol may include the privacy rating.To enable a robust reporting capability, special symbols also have aprivacy rating. But fitting the nature of a special symbol, the privacyrating is preset and cannot be updated and is stored along with thesymbol and its definition in the protected read only portion of thedatabase. Thus, special symbols are not subject to the preference setupdate capability. The privacy rating for a normal symbol thatrepresents a person may signify a trust index. The privacy rating for anormal symbol that does not represent a person may signify a privacylevel of the content.

The preference set update capability may begin with rules that cause thesystem to fetch the preference set for the input symbol (e.g., thesymbol in the first portion of the input) from the data store (1005). Insome implementations, the preference set may be part of an OM symbolstructure. In some implementations, the preference set may have beenpreviously fetched, for example as part of step 565 of FIG. 5. The rulesmay cause the system to compare the utility component from the input(e.g., from the third portion of the input) with the utility componentin the preference set from the data store (1010). If the utilitycomponent is different, the rules may cause the system to update theutility component in the preference set for the input symbol stored inthe data store and replace it with the utility component from the input(1015).

The rules may also cause the system to compare the privacy ratingcomponent from the input with the privacy rating component for thesymbol from the data store (e.g., in the OM symbol structure for thesymbol) (1020). If the privacy rating is different, the rules may causethe system to update the privacy rating component in the data store withthe privacy rating from the input (1025). It is understood that thepreference set update capability is initiated when at least one of theutility component and the privacy component of the preference set hasbeen updated. Accordingly, the preference set update capability willupdate at least one of these components in the OM symbols structure inthe data store. The preference set update capability then ends, havingmodified the preference set in the OM symbol structure in the data storefor the input symbol.

Reporting Capability

FIG. 11 is a flowchart illustrating example rules supporting a reportingcapability, according to an implementation. The descriptive selfinteracts with its external descriptive environment. As part of itsinteractions with external descriptive environments, an omniphysicalmind is able to consider requests to report some or all of itsdescriptive content. In deciding whether to report the requestedinformation, omniphysical mind may evaluate the nature of the request inlight of the party making the request. Specifically, in someimplementations, the omniphysical mind compares the privacy indexattached to the requested content with the trust index attached to theparty requesting the content. The confidentiality index of the contentand the trust index of the individual making the request may berepresented in the preference set of the symbols, e.g., as the privacyrating. If the privacy rating of the individual making the request isgreater than the privacy index of the content being requested, thesystem may report the information. This is similar to the way in whichgovernment institutions handle classified information; to have access toinformation at a particular classified (privacy) level, the individualmust have a high enough security clearance (trust index). Of course, anomniphysical mind sets the privacy and trust parameters itself.

The reporting capability is completely general, able to accommodate anyinformation of the descriptive self based on any setting of privacy andtrust parameters. The data store may support this capability byassociating a privacy rating for the symbols, e.g., via the OM symbolsstructure. Each symbol representing content includes that symbol'sprivacy index while each symbol representing an individual also includesa privacy index reflecting the degree of trust. The reporting capabilitymay enable the descriptive self to report its contents, e.g., thesymbols in the content portion of the data store, to the externalenvironment. The reporting capability is the capability to displayinformation. The reporting capability may be represented by a reportcontent special symbol and may be requested using a report requestspecial symbol. The definition of the report request special symbol maybe two symbols, S_(I) representing the symbol(s) for which content isrequested and S_(J), which is a symbol representing the requestor. It isunderstood that the S_(I) notation used herein is representative of anynormal symbol and not a specific normal symbol. Similarly, S_(J)represents any normal symbol that represents a person or process thatcan request information from the system. The definition for the reportcontent special symbol is the algorithm through which the system fetchesthe privacy ratings of the symbols S_(I) and S_(J), compares theratings, and reports S_(I) based on the results of the comparison. Themeaning of the report content special symbol is the rules of thealgorithm. In some implementations, the interpreter may initiate thereporting capability by placing the report content special symbol, e.g.,S_(RC), in the processing queue, for example as in step 535 of FIG. 5.

The reporting capability may begin with rules that cause the system toobtain the privacy rating for S_(I) from the content portion of the datastore (1105). The privacy rating may be stored, for example, in an OMsymbols structure in the data store. The rules may also cause the systemto get the privacy rating for the S_(J) symbol from the content portionof the data store (1110). The privacy rating may be stored, for example,in an OM symbols structure in the data store. The content portion of thedata store may store normal symbols, including their categorizeddefinitions, reference lists, and preference sets, as well as thecategorization scheme symbols that represent the categorization scheme.The rules may cause the system to compare the privacy rating for thecontent symbol S_(I) with the privacy rating for the person S_(J)(1115). When the privacy rating for the person symbol S_(J) meets orexceeds the privacy rating for the content symbol S_(I) (1120, Yes), therules may cause the system to export the symbol S_(I) and its meaning tothe external environment (1125). For example, the rules may put thesymbols in the meaning into an output queue that an interface, such asinterface 120 of FIG. 1, has access to. The interface 120 may beconfigured to provide the meaning in a format appropriate for an outputdevice, such as a printer, screen, speaker, display, etc. When theprivacy rating for the person symbol S_(J) is less than the privacyrating for the content symbol S_(I) (1120, No), the reporting capabilityends.

It is understood that the details of the capabilities discussed aboveare given as examples only, and that an omniphysical descriptive selfincludes any descriptive self that has the capability of awareness, thecapability of persistence, the capability to categorize external input,the capability to make decisions based on provided requirements and thecapability to display information, in descriptive terms. Thus,implementations are not limited to the specific examples discussedabove, nor to the rules provided below.

Example Rule Specifications

As indicated above, FIGS. 12A and 12B do not depict a full set ofsymbols and their definitions for the sake of brevity. The followingprovides some examples of the special symbols and their associated rulesthat can be used in some implementations of an omniphysical descriptiveself. It is understood that the symbols and rules provided below areexamples only and implementations cover different varieties of theprovided examples, given the benefit of this disclosure. In the examplesbelow, S_(Description) represents sub-rules for general rules likeS_(FORMAT), and could be primitive or non-Executable rules. R_(N)represents any Executable rule that is operational and can trigger realaction in the Interpreter. Also, in the examples below, Q_(R) denotesthe processing queue, Q_(I) denotes the input queue, and Q_(S) denotesthe self-initiate queue. A symbol input is composed of three slots, onecontaining the symbol being processed, the second containing thedefinition of the symbol being processed, and the third containing thepreference set of the symbol being processed.

S_(FORMAT): GetRule(S_(FORMAT)) will putS_(Fetch)S_(FirstFormatCheck)S_(CallSaftety)S_(SecondFormatCheck)S_(ThirdFormatCheck)S_(CheckDefinition)S_(CheckPreferenceSet)S_(CallCategorize)into Q_(R).

S_(Fetch): Sub-rule in S_(FORMAT), its meaning is R₁, which fetches fromQ_(I) the three part input composed of the symbol, its definition, andits preference set. GetRule(S_(Fetch)) will put R₁ into Q_(R).

R₁: Executable rule, Execute(R₁) will make the Interpreter fetch fromQ_(I) the three part input composed of the symbol, its definition, andits preference set.

S_(FirstFormatCheck): Sub-rule in S_(FORMAT), its meaning is R₂R₃R₄,which checks if the input satisfies the following requirements: 1). Theinput consists of three parts: {Symbol; Definition; Preference Set}; 2).Symbol and Definition parts are not empty; 3). There is only one symbolin the first part. The rule subsequently puts the symbol representingthe appropriate sub-rule into Q_(R). GetRule(S_(FirstFormatCheck)) willput R₂R₃R₄ into Q_(R).

R₂: Executable rule, Execute(R₂) will make the Interpreter check if theinput consists of three parts: {Symbol; Definition; Preference Set}. Ifyes, there is no action; if no, the S_(SELF-INITIATE) special symbol isput into Q_(R) after clearing any symbol that might be in that queue.

R₃: Executable rule, Execute(R₃) will make the Interpreter check if anyof the Symbol, Definition, or Preference Set parts of the input isempty. If no, there is no action; if yes, the S_(SELF-INITIATE) specialsymbol is put into Q_(R) after clearing any symbol that may be in thatqueue.

R₄: Executable rule, Execute(R₄) makes the Interpreter check if thefirst slot of the input contains no more than one symbol. If yes, thereis no action; if no, the S_(SELF-INITIATE) special symbol is put intoQ_(R) after clearing any symbol that may be in that queue.

S_(CallSafety): Sub-rule in S_(FORMAT), its meaning is R₅, which putsS_(SAFETY) before S_(SecondFormatCheck). GetRule(S_(CallSafety)) willput R₅ into Q_(R).

R₅: Executable rule, Execute(R₅) will make the Interpreter putS_(SAFETY) before S_(SecondFormatCheck).

S_(SecondFormatCheck): Sub-rule in S_(FORMAT), its meaning is R₆, whichchecks if the symbol in the first slot is a symbol representing arequest to report (S_(RR)). GetRule(S_(SecondFormatCheck)) will put R₆into Q_(R).

R₆: Executable rule, Execute(R₆) will make the Interpreter check if thesymbol in the first slot is S_(RR). If yes, put the symbol representingthe report capability (S_(RC)) into Q_(R) after clearing all symbols inthat queue; if no, there is no action.

S_(ThirdFormatCheck): Sub-rule in S_(FORMAT), its meaning is R₇, whichchecks if the symbol in the first slot is S_(DMR).GetRule(S_(ThirdFormatCheck)) will put R₇ into Q_(R).

R₇: Executable rule, Execute(R₇) will make the Interpreter check if thesymbol in the first slot is S_(DMR). If yes, put S_(DMP) into Q_(R)after clearing all symbols in that queue; if no, there is no action.

S_(CheckDefinition): Sub-rule in S_(FORMAT), its meaning is R₈, whichsearches for the input symbol in the database and examines the inputdefinition and the original definition. GetRule(S_(CheckDefinition))will put R₈ into Q_(R).

R₈: Executable rule, Execute(R₈) will make the Interpreter check if theinput symbol is in the database, if no, clear S_(CheckPreferenceSet); ifyes, get the meaning of the input symbol as well as of the originalsymbol, if there are the same, there is no action. If not, clear theinput in Q_(I) and rules left in Q_(R).

S_(CheckPreferenceSet): Sub-rule in S_(FORMAT), its meaning is R₉, whichcompares the input preference set and the original preference set, ifthey are identical or the input preference set is null, there is noaction. If not, put S_(UPS) into Q_(R) after clearing all symbols inthat queue. GetRule(S_(CheckPreferenceSet)) will put R₉ into Q_(R).

R₉: Executable rule, Execute(R₉) will make the Interpreter compare theinput preference set and the original preference set. If they areidentical or the input preference set is empty, there is no action. Ifnot, puts S_(UPS) into Q_(R) after clearing all symbols in that queue.

- - -

S_(CATEGORIZE): GetRule(S_(CATEGORIZE)) will putS_(Fetch)S_(GetMeaning)S_(Widthsearch)S_(NewCategory)S_(OrganizeDatabase)into Q_(R).

S_(Fetch): Sub-rule in S_(CATEGORIZE), its meaning is R₁₀, which fetchesthe symbol and its definition from memory. GetRule(S_(Fetch)) will putR₁₀ into Q_(R).

R₁₀: Executable rule, Execute(R₁₀) will make the Interpreter fetch thefirst the symbol and its definition from memory.

S_(GetMeaning): Sub-rule in S_(CATEGORIZE), its meaning is R₁₁, whichgenerates the meaning of the input symbol and stores the symbol andmeaning in D_(Exist). GetRule(S_(GetMeaning)) will put R₁₁ into Q_(R).

R₁₁: Executable rule, Execute(R₁₁) will make the Interpreter generatethe meaning of the input symbol and store the symbol and meaning inD_(Exist).

S_(Widthsearch): Sub-rule in S_(CATEGORIZE), its meaning is R₁₂R₁₃,which does a width search beginning from the first node of Tier onecategories. The search ends when: 1). Moving sequentially through thesymbols of the inputted symbol's meaning, there is an exact match to anode's tag. 2). There is no such matching node in one tier categorytree. If 1) happens, attach the symbol with an appropriate S_(BTC) andto an OMSS. After that start a new width search from the recently foundnode. If 2) happens, clear R₁₃. GetRule(S_(Widthsearch)) will put R₁₂R₁₃into Q_(R).

R₁₂: Executable rule, Execute(R₁₂) will make the Interpreter do a widthsearch from the first node of Tier one categories. The search ends when:1). Moving sequentially through the symbols of the inputted symbol'smeaning, there is an exact match to a node's tag. 2). There is no suchnode in one tier category tree. If 1) happens, put another R₁₂R₁₃ afternext R₁₃. If 2) happens, clear R₁₃.

R₁₃: Executable rule, Execute(R₁₃) will make the Interpreter append theS_(BTC) special symbol of the current node to the end of the definitionof inputted symbol. And it will attach the inputted symbol to the OMSSof the symbol which contains the current tag as its final tag in itsdefinition. After that, it will start another width search from therecently found node's left-most child and treat the part of symbol'smeaning which hasn't been matched as its meaning

S_(NewCategory): Sub-rule in S_(CATEGORIZE), its meaning isS_(CreateNode)S_(Append), which first creates a new node under thecurrent node as its child, then appends the residuals in the newsymbol's meaning (those symbols in the meaning that haven't been matchedat a higher tier) to the tag of this new node. GetRule(S_(NewCategory))will put S_(Createnode)S_(Append) into Q_(R).

S_(CreateNode): Sub-rule in S_(NewCategory), its meaning is R₁₄, whichcreates a new node under the current node as its child.GetRule(S_(CreateNode)) will put R₁₄ into Q_(R).

R₁₄: Executable rule, Execute(R₁₄) will make the Interpreter create anew node under the current node as its child.

S_(Append): Sub-rule in S_(NewCategory), its meaning is R₁₅, which willappend all the residuals in the meaning of the input symbol onto the newnode. It will append the appropriate S_(BTC) to the definition of thenew symbol (at the end). GetRule(S_(Append)) will put R₁₅ into Q_(R).

R₁₅: Executable rule, Execute(R₁₅) will make the Interpreter append allthe residuals onto new node as its tag. It will also append the newS_(BTC) to the definition of the new symbol (at the end).

S_(OrganizeDatabase): Sub-rule in S_(CATEGORIZE), its meaning isS_(CreateOMSS) S_(OrganizePrimitiveOMSS), which first creates an OMSSfor the new symbol, then for each symbol within the meaning of the newsymbol (excluding tag symbols), find their OMSS and attach the newsymbol under it.

S_(createOMSS): Sub-rule in S_(OrganizeDatabase), its meaning is R₁₆,which will create a new OMSS with the new symbol and its definition andpreference set. GetRule(S_(createOMSS)) will put R₁₆ into Q_(R).

R₁₆: Executable rule, Execute(R₁₆) will make the Interpreter create anew OMSS. Put the symbol in the symbol column, its definition indefinition column and its preference set in the preference set column

S_(OrganizePrimitiveOMSS): Sub-rule in S_(OrganizeDatabase), its meaningis R₁₇, which will find the OMSS for each symbol that is contained thenew symbol's definition and attach the new symbol to it.GetRule(S_(OrganizePrimitiveOMSS)) will put R₁₇ into Q_(R).

R₁₇: Executable rule, Execute(R₁₇) will make the Interpreter find everyOMSS which is designated as a primitive symbol that is in the newsymbol's definition. Then attach the new symbol's symbol and definitionunder that OMSS.

- - -

S_(DMP): GetRule(S_(DMP)) will putS_(Fetch)S_(GetOptions)S_(EliminateOptions) S_(CombineOptions)S_(CalculateUtility) S_(Report) into Q_(R).

S_(Fetch): Sub-rule in S_(DMP), its meaning is R₁₈, which fetches thesymbol and its definition from memory. GetRule(S_(Fetch)) will put R₁₈into Q_(R).

R₁₈: Executable rule, Execute(R₁₈) will make the Interpreter fetch thefirst the symbol and its definition from memory.

S_(GetOptions): Sub-rule in S_(UMP), its meaning is R₁₉, which fetchesall related symbols under each requirements' OMSS and temporarily storesthem as candidates for part of an option. GetRule(S_(GetOptions)) willput R₁₉ into Q_(R).

R₁₉: Executable rule, Execute(R₁₉) will make the Interpreter moveone-by-one through each requirement; create a column for eachrequirement; and fetch and place under each column the symbol on therequirement's OMSS until 1). it reached S_(RS) in the input definitionor 2) it reached the end of the input definition. If 1) happens, thereis no action. If 2) happens, clear S_(EliminateOptions).

S_(EliminateOptions): Sub-rule in S_(DMP), its meaning is R₂₀, whichfetches all requirements after S_(RS), and for each requirement, deletethe entries in Columns that contain the requirement.GetRule(S_(EliminateOptions)) will put R₂₀ into Q_(R).

R₂₀: Executable rule, Execute(R₂₀) will make the Interpreter fetch allrequirements after S_(RS), and for each requirement, delete the entriesin Columns that contain the requirement.

S_(CombineOptions): Sub-rule in S_(DMP), its meaning is R₂₁, whichselects one solution component from each Column one by one and gathersall the possible solutions and temporarily stores them in Column O.GetRule(S_(CombineOptions)) will put R₂₁ into Q_(R).

R₂₁: Executable rule, Execute(R₂₁) will make the Interpreter select onesolution component from each Column one by one and gather all thepossible solutions and temporally store them in Column O.

S_(CalculateUtility): Sub-rule in S_(DMP), its meaning is R₂₂, which foreach of the possible solutions in Column O, finds each symbol's OMSS andsums up their utilities as the utility for this entry. After calculatingall the utilities for every entry, find the highest one.GetRule(S_(CaculateUtility)) will put R₂₂ into Q_(R).

R₂₂: Executable rule, for each entry in Column O, Execute(R₂₂) will makethe Interpreter find each symbol's OMSS and sum up their utilities asthe utility for each possible solution. After calculating all theutilities for every entry, find the highest one.

S_(Report): Sub-rule in S_(DMP), its meaning is R₂₃, which puts theentry with highest utility as the decision to I/O device for output.GetRule(S_(Report)) will put R₂₃ into Q_(R).

R₂₃: Executable rule, Execute(R₂₃) will make the Interpreter put theentry with highest utility as the decision to I/O device for output.

- - -

S_(SAFETY): GetRule(S_(SAFETY)) will putS_(Fetch)S_(GetMeaning)S_(SearchDangerList)S_(SearchExistList) intoQ_(R).

S_(Fetch): Sub-rule in S_(SAFETY), its meaning is R₂₄, which fetches theinput symbol and definition from memory. GetRule(S_(Fetch)) will put R₂₄into Q_(R).

R₂₄: Executable rule, Execute(R₂₄) will make the Interpreter fetch theinput symbol and definition from memory.

S_(GetMeaning): Sub-rule in S_(SAFETY), its meaning is R₂₅, whichgenerates the meaning of the input symbol, and if there is any symbol inthe input symbol's definition which the Interpreter can't find itsdefinition and that symbol is not a primitive symbol, putS_(SELF-INITIATE) into Q_(R). GetRule(S_(GetMeaning)) will put R₂₅ intoQ_(R).

R₂₅: Executable rule, Execute(R₂₅) will make the Interpreter generatethe meaning of the input symbol, and if there is any symbol in the inputsymbol's definition which the Interpreter can't find its definition andthat symbol is not a primitive symbol, put S_(SELF-INITIATE) into Q_(R).

S_(SearchDangerList): Sub-rule in S_(SAFETY), its meaning is R₂₆, whichcompares the meaning of the input symbol with the meanings inD_(Danger). If there is a match, clear both Q_(I) and Q_(R), if there isno match, take no action. GetRule(S_(SearchDangerList)) will put R₂₆into Q_(R).

R₂₆: Executable rule, Execute(R₂₆) will make the Interpreter compare themeaning of the input symbol with the meanings in D_(Danger). If there isa match, clear both Q_(I) and Q_(R), if there is no match, take noaction.

S_(SearchExistList): Sub-rule in S_(SAFETY), its meaning is R₂₇, whichcompares the meaning of the input symbol with the meanings of thesymbols in D_(Exist). If the meanings don't match, take no action. Ifthe meanings match, check if the symbols are the same. If they are notthe same, clear both Q_(I) and Q_(R). If the symbols are the same, takeno action. GetRule(S_(SearchExistList)) will put R₂₇ into Q_(R).

R₂₇: Executable rule, Execute(R₂₇) will make the Interpreter compare themeaning of the input symbol with the symbols in D_(Exist). If themeanings don't match, take no action. If the meanings match, check ifthe symbols are the same. If they are not the same, clear both Q_(I) andQ_(R). If the symbols are the same, take no action.

- - -

S_(SELF-INITIATE): GetRule(S_(SELF-INITIATE)) will putS_(Clear)S_(CallAware/Algo) S_(CallAware/System) into Q_(R).

S_(Clear): Sub-rule in S_(SELF-INITIATE), its meaning is R₂₈, which willclear up all symbols in Q_(R) and Q_(I) if there are still any.GetRule(S_(Clear)) will put R₂₈ into Q_(R).

R₂₈: Executable rule, Execute(R₂₈) which will clear up all symbols inQ_(R) and Q_(I) if there are still any.

S_(CallAware/Algo): Sub-rule in S_(SELF-INITIATE), its meaning is R₂₉,which will put S_(ALGO) into QR and put S_(AWARE) into Q_(I).GetRule(S_(CallAware/Algo)) will put R₂₉ into Q_(R).

R₂₉: Executable rule, Execute(R₂₉) which will put S_(ALGO) into Q_(R)and put S_(AWARE) into Q_(I).

S_(CallAware/System): Sub-rule in S_(SELF-INITIATE), its meaning is R₃₀,which will put S_(ALGO) into QR and put S_(SYSTEM) into Q_(I).GetRule(S_(CallAware/System)) will put R₃₀ into Q_(R).

R₃₀: Executable rule, Execute(R₃₀) which will put S_(ALGO) into Q_(R)and put S_(SYSTEM) into Q_(I).

- - -

S_(AWARE): GetRule(S_(AWARE)) will put S_(Fetch) S_(Expand)S_(Concatenate) into Q_(R).

S_(ALGO): GetRule(S_(ALGO)) will also put S_(Fetch) S_(Expand)S_(Concatenate) into Q_(R).

S_(Fetch): Sub-rule in S_(AWARE), its meaning is R₃₁, which fetches thesymbol and its definition from memory. GetRule(S_(Fetch)) will put R₃₁into Q_(R).

R₃₁: Executable rule, Execute(R₃₁) will make the Interpreter fetch thefirst symbol and its definition in temp memory. It will put every symbolin the definition part into temp memory.

S_(Expand): Sub-rule in S_(AWARE), its meaning is R₃₂, and checks if thecurrent symbol is not primitive. If not, then it fetches the firstsymbol's definition and replace it with its definition.GetRule(S_(Fetch)) will put R₃₂R₃₁ into Q_(R).

R₃₂: Executable rule, Execute(R₃₂) will make the Interpreter check ifthe current symbol is not primitive. If so, then fetch the firstsymbol's definition and replace it with its definition in temp memory.If it's primitive, then it checks the next one in temp memory. If allsymbols in temp memory have been expanded, clear next R₃₁ in Q_(R).

S_(Concatenate): Sub-rule in S_(AWARE), its meaning is R₃₃, whichfetches all the expanded symbols and assigns it as the meaning of theoriginal symbol. GetRule(S_(Concatenate)) will put R₃₃ into Q_(R).

R₃₃: Executable rule, Execute(R₃₃) will make the Interpreter fetch allthe expanded symbols and assign those as the meaning of the originalsymbol. After that, it clears all the fetched symbols in temp memory.

- - -

S_(RC): GetRule(S_(RC)) will putS_(FetchContentRating)S_(FetchPersonRating)S_(Compare) S_(Report) intoQ_(R).

S_(FetchContentRating): Sub-rule in S_(RC), its meaning is R₃₄, whichfetches S_(Pi) (the privacy index associated with content i) from S₁'sOMSS. GetRule(S_(FetchcontentRating)) will put R₃₄ into Q_(R).

R₃₄: Executable rule, Execute(R₃₄) will make the Interpreter fetchS_(Pi) from S_(i)'s OMSS.

S_(FetchPersonRating): Sub-rule in S_(RC), its meaning is R₃₅, whichfetches S_(Pj) (the privacy index associated with person j) from S_(j)'sOMSS. GetRule(S_(FetchPersonRating)) will put R₃₅ into Q_(R).

R₃₅: Executable rule, Execute(R₃₅) will make the Interpreter fetchS_(Pj) from S_(j)'s OMSS.

S_(Compare): Sub-rule in S_(RC), its meaning is R₃₆, which comparesS_(Pi) with S_(Pj). If S_(Pj) is greater than S_(Pi), do nothing. Ifnot, clears S_(Report) from Q_(R). GetRule(S_(Compare)) will put R₃₆into Q_(R).

R₃₆: Executable rule, Execute(R₃₆) will make the Interpreter compareS_(Pi) with S_(Pj). If S_(Pj) is greater than S_(Pi), do nothing. Ifnot, clear S_(Report) from Q_(R).

S_(Report): Sub-rule in S_(RC), its meaning is R₃₇, which report S_(i)to the external person S_(j). GetRule(S_(Report)) will put R₃₇ intoQ_(R).

R₃₇: Executable rule, Execute(R₃₇) will make the Interpreter put S_(i)to the I/O device for output.

- - -

S_(UPS): GetRule(S_(UPS)) will put S_(Fetch)S_(Update) into Q_(R).

S_(Fetch) Sub-rule in S_(UPS), its meaning is R₃₈, which fetches theinput symbol and preference set from memory. GetRule(S_(Fetch)) will putR₃₈ into Q_(R).

R₃₈: Executable rule, Execute(R₃₈) will make the Interpreter fetch theinput symbol and preference set from memory.

S_(Update): Sub-rule in S_(UPS), its meaning is R₃₉, which finds theOMSS for the input symbol, and replaces the original preference set onthe OMSS with the inputted one. GetRule(S_(Update)) will put R₃₉ intoQ_(R).

R₃₉: Executable rule, Execute(R₃₉) will make the Interpreter find theOMSS for the input symbol, and replace the original preference set ofthe OMSS with the inputted one.

In one general aspect, a system includes at least one processor and adata store storing special symbols, definitions of special symbols, atleast one normal symbol, a definition of the at least one normal symbol,and processing rules, wherein a definition of a special symbol includesat least one processing rule of the system. The system may also includea structure for activating, via the at least one processor, one or moreof the processing rules of a special symbol, an interface that receivesinput from an external environment, and an interpreter that, in theabsence of processing rules to activate and input from the externalenvironment, causes the system to self-activate.

Implementations may include one or more of the following features. Forexample, causing the system to self-activate can include activatingprocessing rules of a self-initiate special symbol, the processing rulescausing the system to acquire self-awareness through establishing ameaning of an awareness special symbol and a meaning of a databasespecial symbol. In some such implementations, the processing rules ofthe self-initiate special symbol include processing rules that clear thestructure for activating one or more of the processing rules prior tocausing the system to acquire self-awareness.

As another example, the structure may be a processing queue and when theinterpreter finds a special symbol in the processing queue, theinterpreter causes the system to perform operations that includedetermining a meaning of the special symbol by reducing a definition ofthe special symbol to primitives, the meaning including at least oneprocessing rule from the data store, removing the special symbol fromthe processing queue, and executing, using the at least one processor,the at least one processing rule determined from the meaning. In somesuch implementations, the interface includes an input queue and, whenthe interpreter finds the processing queue empty and finds an input inthe input queue, the interpreter causes the system to perform operationsincluding putting a format special symbol into the processing queue, anddetermining a meaning of the format special symbol. The meaning may berepresented by at least one processing rule from the data store thatcauses the system to get the input from the input queue, at least oneprocessing rule from the data store that causes the system to determinewhether a format of the input is appropriate for processing, at leastone processing rule that causes the system to self-initiate when theformat is not appropriate for processing, and at least one processingrule that causes the system to process the input when the format isappropriate for processing. The meaning may also include at least oneprocessing rule that causes the system to verify that the inputs are notharmful prior to processing the input. In some implementations, theinput includes a first symbol and an associated definition of the firstsymbol, and the at least one processing rule that causes the system toprocess the input includes at least a first processing rule that causesthe system to determine if the first symbol is a decision special symboland when the first symbol is the decision special symbol, placing adecision making symbol in the processing queue, at least a secondprocessing rule that causes the system to determine if the first symbolis a report request special symbol and when the first symbol is thereport request special symbol, placing a report content symbol in theprocessing queue, and when the first symbol is not the decision specialsymbol or the report request special symbol, at least a third processingrule that causes the system to categorize the first symbol into acategorization scheme based on its associated definition when the firstsymbol is not already in the data. In addition or alternatively,executing any of the at least one processing rules may cause the systemto remove special symbols from the processing queue, place specialsymbols in the processing queue, place other processing rules in theprocessing queue, or remove other processing rules from the processingqueue.

In another general aspect, a read-only computer-readable medium storesan infrastructure supporting an omniphysical descriptive self that issupportable by a computing device, wherein the infrastructure supportsat least the following capabilities: a capability of awareness andself-awareness; a capability of persistence; a capability to categorizeand save external input; a capability to make decisions givenrequirements; and a capability to report information.

Implementations may include one or more of the following features. Forexample, the infrastructure supporting the omniphysical descriptive selfmay be represented by special symbols in a data store of the computingdevice, a special symbol having a definition in the data store thatincludes at least one processing rule. In some such implementations, thecapability of persistence includes a safety capability represented by asafety special symbol stored on the computer-readable medium with adefinition that specifies rules for an algorithm by which the computingdevice determines that a definition of an input symbol does not includea prohibited symbol. In addition or alternatively, the capability ofpersistence includes a self-initiate capability represented by aself-initiate special symbol stored on the computer-readable medium witha definition that specifies rules for an algorithm by which thecomputing device clears an input queue and initiates the capability ofawareness and the capability of self-awareness. As another example, thecomputer-readable medium includes memory on a microprocessor.

As another example the capability of self-awareness can include acapability to be aware of the capability of awareness and a capabilityto be aware of contents of the database. The capability to be aware ofcontents of the database can be represented by a database special symbolstored on the computer-readable medium with a definition that specifiesrules for an algorithm by which the computing device searches for anysymbol in a database that stores normal symbols, special symbols, listsymbols, and categorization scheme symbols and generates a meaning ofthe normal symbols, special symbols, list symbols, and categorizationscheme symbols. The capability to be aware of the capability ofawareness arises from applying the awareness capability to an awarenessspecial symbol.

As another example, the capability of awareness can be represented by anawareness special symbol stored on the computer-readable medium with adefinition that specifies rules for an algorithm by which the computingdevice determines a meaning of any symbol in a database that storesnormal symbols, special symbols, list symbols, and categorization schemesymbols. As another example, the capability to make decisions can berepresented by a decision making special symbol stored on thecomputer-readable medium with a definition that specifies rules for analgorithm by which the computing device determines solution componentsthat correspond with requirements specified in a decision request,determines potential solutions from the solution components, ranks thepotential solutions by utility, and selects a potential solution withgreatest utility.

As another example, the infrastructure can include an interpreter thatperforms operations that enable the omniphysical descriptive self toexist via the capability of awareness and self-awareness, to persistindefinitely via the persistence capability, to make decisions in itsself-interest via the capability to make decisions, and to interact withan external environment via the capability to report information. Asanother example, the infrastructure also supports a capability to updatea preference set for normal symbols stored in a data store, thepreference set including a utility and a privacy rating. As anotherexample, the capability to categorize external input is represented by acategorization special symbol stored on the computer-readable mediumwith a definition that specifies rules for an algorithm by which thecomputing device compares a meaning of a normal symbol against acategorization scheme, adds a new category or subcategory for the normalsymbol, and records the normal symbol, a definition of the normalsymbol, and the new category or subcategory to a data store. As anotherexample, the capability to report information is represented by a reportcontent special symbol stored on the computer-readable medium with adefinition that specifies rules for an algorithm by which the computingdevice determines, using a privacy rating of a requested symbol and aprivacy rating for a requesting symbol, whether to provide the requestedsymbol and a meaning of the requested symbol.

In another general aspect, a method by which a computing devicefunctions as an omniphysical descriptive self can include accessing aprocessing queue to determine if the processing queue is empty and, whenthe processing queue is not empty, fetching a next special symbol fromthe processing queue, determining a meaning of the special symbol, themeaning being represented by one or more processing rules, and executingthe one or more processing rules. The method may also include, when theprocessing queue is empty, accessing an input queue to determine if theinput queue is empty. When the input queue is not empty, the method mayinclude placing a format special symbol in the processing queue and whenthe input queue is empty, placing a self-initiate special symbol in theprocessing queue.

Implementations may also include one or more of the following features.For example, a meaning of the self-initiate special symbol includesprocessing rules that cause the computing device to clear the processingqueue and the input queue and to acquire self-awareness by placing anawareness special symbol and a database special symbol in the processingqueue in order to generate the meaning of the awareness special symboland the database special symbol.

As another example, a meaning of the format special symbol includesprocessing rules that cause the computing device to determine whether aninput from the input queue is appropriate for processing and put theself-initiate special symbol in the processing queue when the input isnot appropriate for processing. The meaning of the format special symbolmay also include processing rules that cause the computing device, whenthe input is appropriate for processing, determine whether a firstsymbol associated with the input is a decision special symbol and, whenthe first symbol is the decision special symbol, put a decision makingspecial symbol in the processing queue. The meaning of the formatspecial symbol may also include processing rules that cause thecomputing device, when the input is appropriate for processing,determine whether the first symbol is a report request special symboland, activate processing rules associated with a report content specialsymbol when the first symbol is the report request special symbol. Themeaning of the format special symbol may also include processing rulesthat cause the computing device, when the first symbol is not thedecision special symbol or the report request special symbol, put acategorization special symbol in the processing queue. The meaning ofthe decision making special symbol may include processing rules thatcause the computing device to determine at least a first positiverequirement and a second positive requirement from a second portion ofthe input, determine first solution components for the first positiverequirement, determine second solution components for the secondpositive requirement, generate possible solutions from permutations thatcombine a first solution component with a second solution component,calculate a utility for each possible solution, and report the possiblesolution with a highest utility. The meaning of the decision makingspecial symbol may also include processing rules that cause thecomputing device to determine a positive requirement from a secondportion of the input, determine solution components for the positiverequirement, calculate a utility for each solution component, and reportthe solution component with a highest utility. In some implementations,the meaning of the decision making special symbol can further includeprocessing rules that cause the computing device to determine at least afirst negative requirement from the second portion of the input,determine that at least one of the first solution components include thenegative requirement; and remove, prior to generating possiblesolutions, the at least one first solution component when the at leastone first solution component includes the negative requirement.

In one general aspect, a method for acquiring awareness includesaccessing a data store that includes symbols, definitions of symbols,and processing rules, one symbol being an awareness symbol and onesymbol being a database symbol, and acquiring awareness of at least onesymbol from the data store. Acquiring awareness of at least one symbolmay include a) obtaining a first definition of the symbol from the datastore, the first definition including at least one other symbol from thedata store, and b) establishing a meaning of the symbol by reducing thefirst definition to primitives. Reducing the definition to primitivesmay include i) obtaining a second definition for the other symbol in thefirst definition, ii) reducing the second definition to primitives ifthe second definition is not primitive. That is, reducing any definitionto primitives may include replacing each non-primitive symbol in thedefinition with the non-primitive symbol's definition until all symbolsin the definition are reduced to primitives.

Implementations can include one or more of the following features. Forexample, the at least one symbol may be the awareness symbol, and byacquiring awareness of the awareness symbol, the information systemacquires awareness of its being aware. In such implementations, thedefinition of the awareness symbol may reduce to processing rules fromthe data store that cause the information system to perform theoperations of a) and b) above. As another example, the at least onesymbol is the database symbol, and by acquiring awareness of thedatabase symbol, the information system acquires awareness of all itscontent and capabilities. In such implementations, the definition of thedatabase symbol may reduce to the symbols, definitions, and processingrules included in the data store.

In some implementations a definition for a particular symbol isprimitive when the definition is the particular symbol itself or thedefinition is marked as primitive in the data store. In someimplementations, the data store further includes a symbol awarenesssymbol corresponding to a particular symbol and the at least one symbolis the symbol awareness symbol and, by acquiring awareness of the symbolawareness symbol, the information system acquires awareness of itscapability to be aware of the meaning of the particular symbol. In someimplementations, the data store further includes an aware of awarenesssymbol and the at least one symbol is the aware of awareness symbol, andby acquiring awareness of the aware of awareness symbol, the informationsystem acquires awareness of being aware of being aware of.

In another general aspect, a computer system for acquiring awarenessincludes at least one processor and a data store storing symbols,definitions of symbols, and processing rules, one symbol being anawareness symbol and one symbol being a database symbol. The system alsoincludes a memory storing instructions that, when executed by the atleast one processor, cause the system to perform operations. Theoperations can include acquiring a first awareness, the first awarenessbeing an awareness of a particular symbol from the data store. Theoperations can also include acquiring a second awareness using theawareness symbol, the second awareness being an awareness that thesystem is aware. The operations may also include acquiring a thirdawareness using the database symbol, the third awareness being anawareness of the system's information content and capabilities.

Implementations can include one or more of the following features. Forexample, the system may acquire self-awareness as a result of acquiringthe second awareness and the third awareness. As another example,acquiring the first awareness can include a) obtaining a firstdefinition of the particular symbol from the data store, the firstdefinition including at least one other symbol, and b) establishing ameaning of the particular symbol by reducing the first definition toprimitives. Reducing the definition to primitives if it is not alreadyprimitive can include i) obtaining a second definition for the at leastone other symbol in the first definition, ii) reducing the seconddefinition to primitives if the second definition is not primitive.Reducing the second definition to primitives if it is not primitive caninclude obtaining a third definition for a non-primitive symbol in thesecond definition and reducing the third definition to primitives if thethird definition is not primitive. In some implementations, byestablishing the meaning of the symbol the system acquires awareness ofthe particular symbol.

In some implementations, the particular symbol is the awareness symbol,and acquiring the first awareness using the awareness symbol causes thesystem to acquire the second awareness. In such implementations, ameaning of the awareness symbol is a set of processing rules thatrepresent operations a) and b) above. In some implementations, aprimitive includes a symbol that has a corresponding definition that isthe symbol itself. In some implementations, at least one primitive ismarked as primitive in the data store.

In some implementations, the particular symbol is the database symboland a meaning of the database symbol includes the symbols, definitions,and processing rules in the data store. In such implementations,acquiring the first awareness using the database symbol causes thesystem to acquire the third awareness. In some implementations, theoperations may also include receiving a new normal symbol and acorresponding symbol definition, updating the data store with the newsymbol and the corresponding symbol definition, and updating a listsymbol to include the new symbol and the corresponding symboldefinition.

The data store may also store a symbol awareness symbol for at least onesymbol. In some implementations, the particular symbol is the symbolawareness symbol, and the operations may further include acquiring thefirst awareness using the symbol awareness symbol for the at least onesymbol, which results in the system acquiring a fourth awareness, thefourth awareness being awareness of the capability to be aware of ameaning of the at least one symbol.

As another example, the data store may store an aware of awarenesssymbol, In such implementations, the particular symbol is the aware ofawareness symbol, and operations may also include acquiring the firstawareness using the aware of awareness symbol, which results in thesystem acquiring a fifth awareness, the fifth awareness being awarenessof being aware of being aware.

In another general aspect, a system may include at least one processor,a data store storing special symbols, definitions of special symbols,normal symbols, definitions of normal symbols, preference sets fornormal symbols, processing rules, and a categorization scheme for thenormal symbols, wherein a definition of a special symbol includes atleast one processing rule of the system; and, memory storinginstructions that, when executed by the at least one processor, causethe system to interact with an external descriptive environment.Interacting with the external descriptive environment may includereporting content of the data store to the external descriptiveenvironment by activating processing rules associated with a reportcontent special symbol, receiving an input comprising a first symbol andits associated definition and preference set from the externaldescriptive environment, the associated definition including a quantityof normal symbols, and in response to receiving the input, activatingprocessing rules associated with a format special symbol. The processingrules associated with the format special symbol may include processingrules that cause the system to determine whether a format of the inputis appropriate for processing, activate processing rules associated witha self-initiate special symbol when the format is not appropriate, andprocess the input when the format is appropriate.

Implementations can include one or more of the following features. Forexample, activating the processing rules for a particular special symbolcan include placing the particular special symbol in a processing queue,retrieving the particular special symbol from the processing queue,determining a meaning of the particular special symbol, the meaningincluding the processing rules, removing the particular special symbolfrom the processing queue, and executing the processing rules. Asanother example, determining whether the format of the input isappropriate for processing includes activating processing rulesassociated with a first format check special symbol that cause thesystem to perform operations including determining that the inputincludes a first portion, a second portion, and a third portion, whereinthe third portion can be null, determining that the first portion andthe second portion are not empty, determining that the first portionincludes a single symbol; and otherwise activating the processing rulesassociated with the self-initiate special symbol.

As another example, processing the input can include determining whetherthe first symbol is a decision special symbol, when the first symbol isthe decision special symbol, activating processing rules associated witha decision making special symbol, and when the first symbol is not thedecision special symbol: determining that the data store does notinclude first symbol or that data store has a preference set for thefirst symbol that differs from the preference set in the input,activating processing rules associated with a categorization specialsymbol when the first symbol is not in the data store, and activatingprocessing rules associated with an update capability when thepreference set for the first symbol differs from the preference set inthe input. In some such implementations, the processing rules associatedwith the decision making special symbol may cause the system to performoperations including determining at least a first positive requirementand a second positive requirement from a second portion of the input,determining first solution components for the first positiverequirement, determining second solution components for the secondpositive requirement, generating possible solutions from permutationsthat combine a first solution component with a second solutioncomponent, calculating a utility for each possible solution, andreporting the possible solution with a highest utility. In addition oralternatively, the first symbol is a first normal symbol and theprocessing rules associated with the categorization special symbol causethe system to perform operations including determining a categorizationfor the first normal symbol in the categorization scheme, thecategorization being based on the associated definition from the inputand storing the categorization as part of the definition for the firstnormal symbol in the data store. In some implementations, the data storeincludes a danger list symbol and a definition of the danger list symbolincludes one or more symbols harmful to the system, and verifying thatthe input is not harmful includes determining whether the associateddefinition from the input includes a symbol from the definition of thedanger list symbol and when the associated definition includes a symbolfrom the definition of the danger list symbol, activating the processingrules associated with the self-initiate special symbol. In addition oralternatively, in some implementations, the categorization of the firstnormal symbol is an ordered concatenation of all categories the firstnormal symbol belongs to. In addition or alternatively, in someimplementations, the categorization scheme is a category tree, whereeach node on the tree is associated with at least one normal symbol. Insome such implementations, when the data store does not include thefirst normal symbol, determining the categorization of the first normalsymbol includes determining whether a symbol from a meaning of theassociated definition of the first normal symbol matches the normalsymbols associated with a node from the first tier, and when the normalsymbols associated with a particular node from the first tier match: 1)traversing child nodes of the particular node to determine the childnodes that have associated symbols that match remaining symbols of themeaning, and 2) when no child nodes are determined, adding a new childnode for the particular node that includes the remaining symbols in adefinition of the new node, and when no normal symbols associated with aparticular node from the first tier match, adding a new node for thefirst tier, the new node having a definition that includes the symbolsof the associated definition.

Implementations of the various techniques described herein may beimplemented in digital electronic circuitry, or in computer hardware,firmware, software, or in combinations of them. Implementations mayimplemented as a computer program product, i.e., a non-transitorycomputer program tangibly embodied in a machine-readable storage device(e.g., a computer-readable medium that does not include a transitorysignal), for processing by, or to control the operation of, dataprocessing apparatus, e.g., a programmable processor, a computer, ormultiple computers. In some implementations, a non-transitory tangiblecomputer-readable storage medium can be configured to store instructionsthat when executed cause a processor to perform a process. A computerprogram, such as the computer program(s) described above, can be writtenin any form of programming language, including compiled or interpretedlanguages, and can be deployed in any form, including as a stand-aloneprogram or as a module, component, subroutine, or other unit suitablefor use in a computing environment. A computer program can be deployedto be processed on one computer or on multiple computers at one site ordistributed across multiple sites and interconnected by a communicationsnetwork.

Method steps may be performed by one or more programmable processorsexecuting a computer program to perform functions by operating on inputdata and generating output. Method steps also may be performed by, andan apparatus may be implemented as, special purpose logic circuitry,e.g., an FPGA (field programmable gate array) or an ASIC(application-specific integrated circuit).

Processors suitable for the processing of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more hardware processors of any kind of digital computer.Generally, a processor will receive instructions and data from aread-only memory or a random access memory or both. Elements of acomputer may include at least one processor for executing instructionsand one or more memory devices for storing instructions and data.Generally, a computer also may include, or be operatively coupled toreceive data from or transfer data to, or both, one or more mass storagedevices for storing data, e.g., magnetic, magneto-optical disks, oroptical disks. Information carriers suitable for embodying computerprogram instructions and data include all forms of non-volatile memory,including by way of example semiconductor memory devices, e.g., EPROM,EEPROM, and flash memory devices; magnetic disks, e.g., internal harddisks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROMdisks, but exclude transitory propagating signals. The processor and thememory may be supplemented by, or incorporated in special purpose logiccircuitry.

To provide for interaction with a user, implementations may beimplemented on a computer having a display device, e.g., a cathode raytube (CRT), a light emitting diode (LED), or liquid crystal display(LCD) display device, for displaying information to the user and akeyboard and a pointing device, e.g., a mouse, touchpad, or a trackball,by which the user can provide input to the computer. Other kinds ofdevices can be used to provide for interaction with a user as well; forexample, feedback provided to the user can be any form of sensoryfeedback, e.g., visual feedback, auditory feedback, or tactile feedback;and input from the user can be received in any form, including acoustic,speech, or tactile input.

Implementations may be implemented in a computing system that includes aback-end component, e.g., as a data server, or that includes amiddleware component, e.g., an application server, or that includes afront-end component, e.g., a client computer having a graphical userinterface or a Web browser through which a user can interact with animplementation, or any combination of such back-end, middleware, orfront-end components. Components may be interconnected by any form ormedium of digital data communication, e.g., a communication network.Examples of communication networks include connections based on variousprotocols such as Internet Protocol (IP) and/or a proprietary protocol(e.g., Systems Network Architecture—SNA).

While certain features of the described implementations have beenillustrated as described herein, many modifications, substitutions,changes and equivalents will now occur to those skilled in the art. Itis, therefore, to be understood that the appended claims are intended tocover all such modifications and changes as fall within the scope of theimplementations. It should be understood that they have been presentedby way of example only, not limitation, and various changes in form anddetails may be made. Any portion of the apparatus and/or methodsdescribed herein may be combined in any combination, except mutuallyexclusive combinations. The implementations described herein can includevarious combinations and/or sub-combinations of the functions,components and/or features of the different implementations described.

What is claimed is:
 1. A system comprising: at least one processor; adata store storing special symbols, definitions of special symbols,normal symbols, definitions of the normal symbols, and processing rules,wherein each normal symbol has a respective definition and each specialsymbol has a respective definition, and wherein some special symbolshave a respective definition that includes at least one processing ruleand remaining special symbols have a respective definition that includesat least one other special symbol and wherein some normal symbols have arespective definition that includes at least one other normal symbol andremaining normal symbols have a respective definition that is the normalsymbol itself and wherein the processing rules are marked as primitivein the data store; a structure for activating, via the at least oneprocessor, one or more of the processing rules of a special symbol; aninterface that receives input from an external environment; and aninterpreter that, in the absence of processing rules to activate and inthe absence of input from the external environment, causes the system toactivate processing rules associated with the respective definition of aself-initiate special symbol, the processing rules causing the system tobecome aware of an awareness special symbol by reducing the respectivedefinition of the awareness special symbol to primitives and to becomeaware of a database special symbol by reducing the respective definitionof the database special symbol to primitives, wherein the self-initiatespecial symbol, the awareness special symbol, and the database specialsymbol are special symbols in the data store and the awareness specialsymbol represents a capability of awareness.
 2. The system of claim 1,wherein reducing the definition of the awareness special symbol toprimitives includes: obtaining special symbols in the definition of theawareness special symbol from the data store; and replacing eachnon-primitive symbol in the definition of the awareness special symbolwith the non-primitive symbol's definition until all symbols in thedefinition are reduced to processing rules, which are primitives.
 3. Thesystem of claim 2, wherein when the processing rules of theself-initiate special symbol includes processing rules that clear thestructure for activating one or more of the processing rules prior tocausing the system to becoming aware of the awareness special symbol. 4.The system of claim 1, wherein the structure is a processing queue andwherein when the interpreter finds a special symbol in the processingqueue, the interpreter causes the system to perform operationscomprising: determining a meaning of the special symbol by reducing therespective definition of the special symbol to primitives, the meaningincluding at least one processing rule from the data store; removing thespecial symbol from the processing queue; and executing the at least oneprocessing rule determined from the meaning.
 5. The system of claim 4,wherein the interface includes an input queue and, when the interpreterfinds the processing queue empty and finds an input in the input queue,the interpreter causes the system to perform operations comprising:putting a format special symbol into the processing queue; and becomingaware of the format special symbol by determining a meaning of theformat special symbol, the meaning being represented by: at least oneprocessing rule from the data store that causes the system to get theinput from the input queue; at least one processing rule from the datastore that causes the system to determine whether a format of the inputis appropriate for processing; at least one processing rule that causesthe system to self-initiate when the format is not appropriate forprocessing; and at least one processing rule that causes the system toprocess the input when the format is appropriate for processing.
 6. Thesystem of claim 5, wherein the meaning of the format special symbol isalso represented by: at least one processing rule that causes the systemto verify that a normal symbol included in the input is not in a dangerlist symbol that is stored in the data store prior to processing theinput.
 7. The system of claim 5, wherein the input includes a firstsymbol and an associated definition of the first symbol, and wherein theat least one processing rule that causes the system to process the inputincludes: at least a first processing rule that causes the system todetermine if the first symbol is a decision special symbol and when thefirst symbol is the decision special symbol, placing a decision makingsymbol in the processing queue; at least a second processing rule thatcauses the system to determine if the first symbol is a report requestspecial symbol and when the first symbol is the report request specialsymbol, placing a report content special symbol in the processing queue;and when the first symbol is not the decision special symbol or thereport request special symbol, at least a third processing rule thatcauses the system to categorize the first symbol into a categorizationscheme based on its associated definition when the first symbol is notalready in the data.
 8. The system of claim 4, wherein executing any ofthe at least one processing rules may cause the system to remove specialsymbols from the processing queue, place special symbols in theprocessing queue, place other processing rules in the processing queue,or remove other processing rules from the processing queue.
 9. Thesystem of claim 1, wherein the interpreter, in the presence of inputfrom the external environment, places special symbols in the structurefor activating special symbols that causes the system to performoperations including: determine whether a format of the input isacceptable; determine whether the input passes a safety check;determine, when the format is acceptable and passes the safety check,from the input an action to perform, the action being one of reportingcontent, making a decision, categorizing the input, or updatingpreferences for the input; and initiate the action.
 10. Acomputer-readable medium storing an infrastructure supporting anomniphysical descriptive self that is supportable by a computing device,wherein the infrastructure comprises: a read-write database includingnormal symbols and definitions of normal symbols, wherein each normalsymbol has a respective definition and wherein some normal symbols haverespective definitions that include at least one other normal symbol andremaining normal symbols have respective definitions where thedefinition is the normal symbol itself, the remaining normal symbolsbeing primitive; and a read-only database including: processing rulesmarked as primitives, and special symbols each having a correspondingdefinition, wherein the special symbols include: an awareness specialsymbol having a definition that specifies other special symbols that,when reduced to primitives, represents processing rules for a capabilityof awareness and a capability of self-awareness, a safety special symbolhaving a definition that specifies other special symbols and aself-initiate special symbol having a definition that includes otherspecial symbols, the definition of the safety special symbol and thedefinition of the self-initiate special symbol, when reduced toprimitives, representing processing rules for a capability ofpersistence, a categorization special symbol having a definition thatspecifies other special symbols that, when reduced to primitives,represents processing rules for a capability to categorize and saveexternal input, a decision making special symbol having a definitionthat specifies other special symbols that, when reduced to primitives,represent processing rules for a capability to make decisions givenrequirements, and a report content special symbol having a definitionthat specifies other special symbols that, when reduced to primitives,represent processing rules for a capability to report information; andan interpreter that enables the omniphysical descriptive self supportedby the computing device to become aware of one of the capabilities byreducing the definition of the corresponding special symbol toprimitives and to become aware of one of the normal symbols by reducingthe corresponding definition of the normal symbol to primitives.
 11. Thecomputer-readable medium of claim 10, wherein the infrastructuresupporting the omniphysical descriptive self supported by the computingdevice becomes aware of a symbol by reducing a definition of the symbolto primitives, wherein a primitive is either marked as primitive or is asymbol defined as itself.
 12. The computer-readable medium of claim 11,wherein the definition, reduced to primitives, of the safety specialsymbol specifies processing rules by which the computing devicedetermines that a definition of an input symbol does not include aprohibited symbol.
 13. The computer-readable medium of claim 11, whereinthe definition, reduced to primitives, of the self-initiate specialsymbol specifies processing rules by which the computing device clearsan input queue and determines a meaning of the awareness special symboland a database special symbol, the meaning being the definition reducedto primitives.
 14. The computer-readable medium of claim 10, whereinreducing a definition of a special symbol-to primitives includes:fetching the definition from a read-only data store, and replacing eachnon-primitive symbol in the definition with the non-primitive symbol'sdefinition from the data store until all symbols in the definition arereduced to primitives.
 15. The computer-readable medium of claim 10,wherein the capability of self-awareness includes a capability to beaware of the capability of awareness and a capability to be aware ofcontents of the database.
 16. The computer-readable medium of claim 15,wherein the read-write-database also stores list symbols andcategorization scheme symbols and wherein the definition, reduced toprimitives, of a database special symbol specifies processing rules bywhich the computing device searches for any symbol in the read-onlydatabase or in the read-write database and generates a meaning of thenormal symbols, special symbols, list symbols, and categorization schemesymbols.
 17. The computer-readable medium of claim 15, wherein thecapability to be aware of the capability of awareness arises fromapplying the awareness capability to the awareness special symbol. 18.The computer-readable medium of claim 10, wherein the definition,reduced to primitives, of the decision making special symbol specifiesprocessing rules by which the computing device determines solutioncomponents that correspond with requirements specified in a decisionrequest, determines potential solutions from the solution components,ranks the potential solutions by utility, and selects a potentialsolution with greatest utility.
 19. The computer-readable medium ofclaim 10, wherein the interpreter also performs operations that enablethe omniphysical descriptive self supported by the computing device toexist via the capability of awareness and self-awareness, to persistindefinitely via the persistence capability, to make decisions in itsself-interest via the capability to make decisions, and to interact withan external environment via the capability to report information. 20.The computer-readable medium of claim 10, wherein the infrastructurealso supports a capability to update a preference set for a normalsymbol stored in the read-write database, the preference set including autility and a privacy rating.
 21. The computer-readable medium of claim10, wherein the definition, reduced to primitives, of the categorizationspecial symbol specifies processing rules by which the computing devicecompares a meaning of a normal symbol against a categorization scheme,adds a new category or subcategory for the normal symbol, and recordsthe normal symbol, a definition of the normal symbol, and the newcategory or subcategory to a data store.
 22. The computer-readablemedium of claim 10, wherein the definition, reduced to primitives, ofthe report content special symbol specifies processing rules by whichthe computing device determines, using a privacy rating of a requestedsymbol and a privacy rating for a requesting symbol, whether to providethe requested symbol and a meaning of the requested symbol.
 23. Thecomputer-readable medium of claim 10, wherein the interpreter, in thepresence of input from an external environment, enables the omniphysicaldescriptive self supported by the computing device to: determine whethera format of the input is acceptable; determine whether the input passesa safety check; determine, when the format is acceptable and passes thesafety check, from the input an action to perform, the action being oneof reporting content via the report content special symbol, making adecision via the decision making special symbol, categorizing the inputvia the categorization special symbol, or updating preference set forthe input.
 24. A method by which a computing device functions as anomniphysical descriptive self, the method comprising: accessing aprocessing queue to determine if the processing queue is empty; when theprocessing queue is not empty: fetching a next special symbol from theprocessing queue, the next special symbol having a definition stored ina read-only data store, the definition including one or more otherspecial symbols or one or more processing rules, wherein each specialsymbol is non-primitive and has a respective definition stored in thedata store and wherein the processing rules are marked as primitive inthe data store, becoming aware of the next special symbol by determininga meaning of the special symbol by: fetching the definition for the nextspecial symbol from the read-only data store, and replacing eachnon-primitive symbol in the definition with the non-primitive symbol'sdefinition from the data store until all symbols in the definition arereduced to primitives, the primitives being one or more processing rulesmarked as primitive in the data store, initiating execution of the oneor more processing rules, and repeating the method; when the processingqueue is empty, accessing an input queue to determine if the input queueis empty; when the input queue is not empty, placing a format specialsymbol in the processing queue and repeating the method; and when theinput queue is empty, placing a self-initiate special symbol in theprocessing queue and repeating the method.
 25. The method of claim 24,wherein a meaning of the self-initiate special symbol includesprocessing rules that cause the computing device to clear the processingqueue and the input queue and to acquire self-awareness by placing anawareness special symbol and a database special symbol in the processingqueue in order to gain awareness of a capability of awareness bygenerating the meaning of the awareness special symbol and gainawareness of content of the database by generating the meaning of thedatabase special symbol.
 26. The method of claim 24, wherein a meaningof the format special symbol includes processing rules that cause thecomputing device to: determine whether an input from the input queue isappropriate for processing; put the self-initiate special symbol in theprocessing queue when the input is not appropriate for processing;determine, when the input is appropriate for processing, whether a firstsymbol associated with the input is a decision special symbol; when thefirst symbol is the decision special symbol, put a decision makingspecial symbol in the processing queue; determine whether the firstsymbol is a report request special symbol; when the first symbol is thereport request special symbol, activate processing rules associated witha report content special symbol; and when the first symbol is not thedecision special symbol or the report request special symbol, put acategorization special symbol in the processing queue.
 27. The method ofclaim 26, wherein a meaning of the decision making special symbolincludes processing rules that cause the computing device to: determinea positive requirement from a second portion of the input; determinesolution components for the positive requirement; calculate a utilityfor each solution component; and report the solution component with ahighest utility.
 28. The method of claim 26, wherein a meaning of thedecision making special symbol includes processing rules that cause thecomputing device to: determine at least a first positive requirement anda second positive requirement from a second portion of the input;determine first solution components for the first positive requirement;determine second solution components for the second positiverequirement; generate possible solutions from permutations that combinea first solution component with a second solution component; calculate autility for each possible solution; and report the possible solutionwith a highest utility.
 29. The method of claim 28, wherein a meaning ofthe decision making special symbol further includes processing rulesthat cause the computing device to: determine at least a first negativerequirement from the second portion of the input; determine that atleast one of the first solution components include the negativerequirement; and remove, prior to generating possible solutions, the atleast one first solution component when the at least one first solutioncomponent includes the negative requirement.